./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:34,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:34,605 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:34,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:34,629 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:34,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:34,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:34,634 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:34,635 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:34,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:34,637 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:34,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:34,640 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:34,646 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:34,648 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:34,651 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:34,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:34,655 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:34,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:34,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:34,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:34,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:34,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:34,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:34,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:34,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:34,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:34,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:34,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:34,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:34,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:34,672 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:34,672 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:34,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:34,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:34,675 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:34,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:34,676 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:34,677 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:34,677 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:34,678 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:34,679 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:34,697 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:34,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:34,698 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:34,698 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:34,699 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:34,699 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:34,699 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:34,699 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:34,699 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:34,700 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:34,700 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:34,700 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:34,701 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:34,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:34,701 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:34,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:34,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:34,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:34,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:34,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:34,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:34,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:34,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:34,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:34,704 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 -> fb567b374acd8bb9754dd21f812a202296c7800faf8be127cd0c1294b076cd75 [2022-02-21 03:24:34,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:34,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:34,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:34,967 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:34,968 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:34,969 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:24:35,028 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b057131/7df419db7fa7418a8692f14ce0dc2d08/FLAG4bb561adc [2022-02-21 03:24:35,361 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:35,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:24:35,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b057131/7df419db7fa7418a8692f14ce0dc2d08/FLAG4bb561adc [2022-02-21 03:24:35,787 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36b057131/7df419db7fa7418a8692f14ce0dc2d08 [2022-02-21 03:24:35,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:35,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:35,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:35,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:35,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:35,801 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:35,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ddd6470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35, skipping insertion in model container [2022-02-21 03:24:35,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:35,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:35,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:35,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:35,951 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:35,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:35,983 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:35,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35 WrapperNode [2022-02-21 03:24:35,984 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:35,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:35,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:35,985 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:35,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:35,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,013 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2022-02-21 03:24:36,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:36,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:36,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:36,015 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:36,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:36,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:36,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:36,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:36,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (1/1) ... [2022-02-21 03:24:36,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,084 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:36,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:36,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:36,171 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:36,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:36,295 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:36,301 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:36,301 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-21 03:24:36,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:36 BoogieIcfgContainer [2022-02-21 03:24:36,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:36,311 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:36,311 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:36,314 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:36,315 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:36,315 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:35" (1/3) ... [2022-02-21 03:24:36,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d890e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:36, skipping insertion in model container [2022-02-21 03:24:36,317 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:36,317 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:35" (2/3) ... [2022-02-21 03:24:36,317 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d890e15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:36, skipping insertion in model container [2022-02-21 03:24:36,318 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:36,318 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:36" (3/3) ... [2022-02-21 03:24:36,319 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2022-02-21 03:24:36,356 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:36,357 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:36,357 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:36,357 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:36,357 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:36,357 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:36,358 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:36,358 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:36,371 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,388 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,388 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,392 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:36,392 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:36,393 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:36,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:36,397 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:36,403 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7#L21true assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 6#L23-2true [2022-02-21 03:24:36,404 INFO L793 eck$LassoCheckResult]: Loop: 6#L23-2true assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 4#L25-2true assume !(main_~j~0#1 < main_~m~0#1); 8#L25-3true main_~i~0#1 := 1 + main_~i~0#1; 6#L23-2true [2022-02-21 03:24:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,409 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:24:36,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319301362] [2022-02-21 03:24:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,498 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,518 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,521 INFO L85 PathProgramCache]: Analyzing trace with hash 43936, now seen corresponding path program 1 times [2022-02-21 03:24:36,521 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398569935] [2022-02-21 03:24:36,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,544 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,561 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash 889513823, now seen corresponding path program 1 times [2022-02-21 03:24:36,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,564 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069996181] [2022-02-21 03:24:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,584 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,592 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,677 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,677 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,678 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:36,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2022-02-21 03:24:36,679 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,679 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:36,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:36,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:36,810 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,811 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:36,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,814 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:36,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:36,817 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,817 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,837 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: [] [2022-02-21 03:24:36,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:36,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:36,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,859 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,876 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: [] [2022-02-21 03:24:36,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,895 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:36,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:36,897 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,897 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,942 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:36,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:36,944 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:36,944 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:37,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,091 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:37,091 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:37,091 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:37,092 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:37,092 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:37,092 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,092 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:37,092 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:37,092 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2022-02-21 03:24:37,092 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:37,092 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:37,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,203 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:37,206 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:37,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,209 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:37,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:37,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:37,279 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:37,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:37,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:37,279 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:37,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:37,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:37,299 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:37,304 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:37,305 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:37,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,313 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,319 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:37,320 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:37,320 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:37,321 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2022-02-21 03:24:37,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:37,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,357 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:37,364 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" "assume !(main_~j~0#1 < main_~m~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" [2022-02-21 03:24:37,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#unseeded} assume { :begin_inline_ULTIMATE.init } true; {22#unseeded} is VALID [2022-02-21 03:24:37,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {22#unseeded} is VALID [2022-02-21 03:24:37,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {22#unseeded} is VALID [2022-02-21 03:24:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,437 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {25#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {46#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:24:37,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume !(main_~j~0#1 < main_~m~0#1); {46#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID [2022-02-21 03:24:37,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} main_~i~0#1 := 1 + main_~i~0#1; {35#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID [2022-02-21 03:24:37,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:37,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:37,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,543 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:37,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,633 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 43 states and 63 transitions. Complement of second has 8 states. [2022-02-21 03:24:37,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:37,634 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:37,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:37,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 63 transitions. [2022-02-21 03:24:37,641 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:37,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,643 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:37,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,647 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:37,647 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,647 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 63 transitions. cyclomatic complexity: 25 [2022-02-21 03:24:37,648 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:37,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:24:37,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:24:37,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:24:37,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:24:37,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:37,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:37,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:37,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:37,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:37,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:37,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:37,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:37,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:37,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:37,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:37,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:37,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:37,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:37,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:37,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 63 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:37,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,685 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2022-02-21 03:24:37,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:37,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 3 letters. Loop has 6 letters. [2022-02-21 03:24:37,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 63 transitions. cyclomatic complexity: 25 [2022-02-21 03:24:37,693 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:37,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 15 states and 22 transitions. [2022-02-21 03:24:37,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2022-02-21 03:24:37,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2022-02-21 03:24:37,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 22 transitions. [2022-02-21 03:24:37,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:37,696 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2022-02-21 03:24:37,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 22 transitions. [2022-02-21 03:24:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-02-21 03:24:37,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:37,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,713 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,715 INFO L87 Difference]: Start difference. First operand 15 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,721 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:37,723 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2022-02-21 03:24:37,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2022-02-21 03:24:37,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:37,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:37,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 22 transitions. [2022-02-21 03:24:37,724 INFO L87 Difference]: Start difference. First operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states and 22 transitions. [2022-02-21 03:24:37,724 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:37,725 INFO L93 Difference]: Finished difference Result 15 states and 22 transitions. [2022-02-21 03:24:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 22 transitions. [2022-02-21 03:24:37,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:37,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:37,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:37,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:37,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2022-02-21 03:24:37,727 INFO L704 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2022-02-21 03:24:37,727 INFO L587 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2022-02-21 03:24:37,727 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:37,727 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-02-21 03:24:37,728 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:37,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,728 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:37,728 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:37,728 INFO L791 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 112#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 116#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 117#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 107#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 108#L28-2 [2022-02-21 03:24:37,728 INFO L793 eck$LassoCheckResult]: Loop: 108#L28-2 assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; 108#L28-2 [2022-02-21 03:24:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash 28693995, now seen corresponding path program 1 times [2022-02-21 03:24:37,729 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:37,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119151201] [2022-02-21 03:24:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,740 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:37,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,741 INFO L85 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2022-02-21 03:24:37,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:37,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830481238] [2022-02-21 03:24:37,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:37,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,744 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,747 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:37,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,747 INFO L85 PathProgramCache]: Analyzing trace with hash 889513877, now seen corresponding path program 1 times [2022-02-21 03:24:37,747 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:37,747 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935249482] [2022-02-21 03:24:37,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:37,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:37,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:37,759 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:37,770 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:37,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:37,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:37,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:37,770 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:37,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:37,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:37,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2022-02-21 03:24:37,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:37,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:37,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:37,812 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:37,812 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:37,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,813 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:37,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:37,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,841 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:37,841 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: [] [2022-02-21 03:24:37,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,858 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:37,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:37,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,872 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:37,873 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: [] [2022-02-21 03:24:37,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:37,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:37,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,932 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:37,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:37,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,073 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:38,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,076 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:38,077 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:38,077 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:38,077 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:38,077 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:38,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:38,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:38,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2022-02-21 03:24:38,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:38,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:38,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:38,143 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:38,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,168 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:38,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:38,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:38,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:38,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:38,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:38,204 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:38,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:38,213 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:38,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:38,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,245 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:38,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:38,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,254 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:38,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,255 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,255 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:38,255 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:38,258 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:38,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:38,262 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:38,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,264 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:38,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:38,312 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:38,312 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:38,312 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~N~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~N~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-02-21 03:24:38,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,334 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:38,338 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1;" [2022-02-21 03:24:38,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:38,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:38,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {199#unseeded} assume { :begin_inline_ULTIMATE.init } true; {199#unseeded} is VALID [2022-02-21 03:24:38,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {199#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {199#unseeded} is VALID [2022-02-21 03:24:38,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {199#unseeded} is VALID [2022-02-21 03:24:38,379 INFO L290 TraceCheckUtils]: 3: Hoare triple {199#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {199#unseeded} is VALID [2022-02-21 03:24:38,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {199#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {199#unseeded} is VALID [2022-02-21 03:24:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,383 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:38,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#(>= oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; {212#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:38,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:38,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:38,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,400 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:38,400 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 10. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 28 states and 44 transitions. Complement of second has 6 states. [2022-02-21 03:24:38,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:38,437 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:38,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:38,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,438 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:38,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,439 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 44 transitions. [2022-02-21 03:24:38,439 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:24:38,439 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,440 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:24:38,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:38,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:38,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:38,442 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 44 transitions. cyclomatic complexity: 22 [2022-02-21 03:24:38,443 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:24:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:24:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:24:38,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 28 letters. Loop has 28 letters. [2022-02-21 03:24:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:38,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:24:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:38,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:38,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:38,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:38,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:38,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:38,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 44 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:38,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,470 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:38,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 03:24:38,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:24:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:38,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 44 transitions. cyclomatic complexity: 22 [2022-02-21 03:24:38,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:24:38,474 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 19 states and 28 transitions. [2022-02-21 03:24:38,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:24:38,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:24:38,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 28 transitions. [2022-02-21 03:24:38,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:38,474 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-02-21 03:24:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 28 transitions. [2022-02-21 03:24:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-21 03:24:38,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:38,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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) [2022-02-21 03:24:38,476 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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) [2022-02-21 03:24:38,476 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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) [2022-02-21 03:24:38,476 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,477 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2022-02-21 03:24:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2022-02-21 03:24:38,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 28 transitions. [2022-02-21 03:24:38,478 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 28 transitions. [2022-02-21 03:24:38,478 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,479 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2022-02-21 03:24:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2022-02-21 03:24:38,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:38,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:38,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 18 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) [2022-02-21 03:24:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2022-02-21 03:24:38,481 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-02-21 03:24:38,481 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 28 transitions. [2022-02-21 03:24:38,481 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:38,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. [2022-02-21 03:24:38,481 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:24:38,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,482 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:38,482 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:38,482 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 276#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 277#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 275#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 282#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 281#L28-3 main_~i~0#1 := main_~k~0#1; 265#L25-2 [2022-02-21 03:24:38,482 INFO L793 eck$LassoCheckResult]: Loop: 265#L25-2 assume !(main_~j~0#1 < main_~m~0#1); 266#L25-3 main_~i~0#1 := 1 + main_~i~0#1; 283#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 265#L25-2 [2022-02-21 03:24:38,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1805126385, now seen corresponding path program 1 times [2022-02-21 03:24:38,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226349738] [2022-02-21 03:24:38,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,490 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,495 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,495 INFO L85 PathProgramCache]: Analyzing trace with hash 51226, now seen corresponding path program 2 times [2022-02-21 03:24:38,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117434413] [2022-02-21 03:24:38,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,499 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,502 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,502 INFO L85 PathProgramCache]: Analyzing trace with hash -765356246, now seen corresponding path program 1 times [2022-02-21 03:24:38,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349556576] [2022-02-21 03:24:38,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,529 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,554 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:38,555 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:38,555 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:38,555 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:38,555 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:38,555 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,555 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:38,555 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:38,556 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2022-02-21 03:24:38,556 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:38,556 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:38,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,623 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:38,623 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:38,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,624 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:38,629 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,629 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:38,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~m~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~m~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:38,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:38,668 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,668 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,685 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:38,685 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: [] [2022-02-21 03:24:38,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,705 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:38,707 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,707 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,737 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:38,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:38,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:38,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,956 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:38,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:24:38,960 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:38,960 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:38,960 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:38,960 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:38,960 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:38,960 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,960 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:38,960 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:38,960 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2022-02-21 03:24:38,961 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:38,961 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:38,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:38,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,042 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:39,043 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,044 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:39,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:39,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:39,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:39,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,072 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:39,072 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:39,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:39,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:39,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,103 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) [2022-02-21 03:24:39,108 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 [2022-02-21 03:24:39,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:39,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:39,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,117 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:39,117 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:39,131 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:39,133 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:39,134 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,135 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) [2022-02-21 03:24:39,136 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 [2022-02-21 03:24:39,137 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:39,137 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:39,138 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:39,138 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:39,158 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 [2022-02-21 03:24:39,164 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:39,167 INFO L390 LassoCheck]: Loop: "assume !(main_~j~0#1 < main_~m~0#1);" "main_~i~0#1 := 1 + main_~i~0#1;" "assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0;" [2022-02-21 03:24:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:39,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:39,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {379#unseeded} assume { :begin_inline_ULTIMATE.init } true; {379#unseeded} is VALID [2022-02-21 03:24:39,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {379#unseeded} is VALID [2022-02-21 03:24:39,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {379#unseeded} is VALID [2022-02-21 03:24:39,204 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {379#unseeded} is VALID [2022-02-21 03:24:39,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {379#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {379#unseeded} is VALID [2022-02-21 03:24:39,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {379#unseeded} is VALID [2022-02-21 03:24:39,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#unseeded} main_~i~0#1 := main_~k~0#1; {379#unseeded} is VALID [2022-02-21 03:24:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,211 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:39,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {382#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 < main_~m~0#1); {382#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-21 03:24:39,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {382#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} main_~i~0#1 := 1 + main_~i~0#1; {418#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:24:39,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {418#(<= (+ |ULTIMATE.start_main_~n~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| oldRank0))} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {392#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID [2022-02-21 03:24:39,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:39,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:39,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,287 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:39,287 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,325 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 32 states and 52 transitions. Complement of second has 8 states. [2022-02-21 03:24:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:39,326 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:39,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:39,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,327 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:24:39,327 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,327 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 52 transitions. [2022-02-21 03:24:39,328 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:39,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,328 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 28 transitions. cyclomatic complexity: 13 [2022-02-21 03:24:39,329 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2022-02-21 03:24:39,329 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:24:39,330 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:39,331 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 32 states and 52 transitions. cyclomatic complexity: 27 [2022-02-21 03:24:39,331 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:39,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 32 letters. Loop has 32 letters. [2022-02-21 03:24:39,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 19 letters. Loop has 19 letters. [2022-02-21 03:24:39,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:39,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:39,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:39,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:39,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:39,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:39,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 28 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 32 states and 52 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:39,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,349 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2022-02-21 03:24:39,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:39,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:39,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:24:39,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:39,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 52 transitions. cyclomatic complexity: 27 [2022-02-21 03:24:39,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:39,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 23 states and 35 transitions. [2022-02-21 03:24:39,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:24:39,354 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:24:39,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 35 transitions. [2022-02-21 03:24:39,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:39,354 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2022-02-21 03:24:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 35 transitions. [2022-02-21 03:24:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-21 03:24:39,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:39,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 35 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,356 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 35 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,356 INFO L87 Difference]: Start difference. First operand 23 states and 35 transitions. Second operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,356 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:39,357 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2022-02-21 03:24:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2022-02-21 03:24:39,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:39,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:39,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 23 states and 35 transitions. [2022-02-21 03:24:39,358 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 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 23 states and 35 transitions. [2022-02-21 03:24:39,358 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:39,359 INFO L93 Difference]: Finished difference Result 23 states and 35 transitions. [2022-02-21 03:24:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 35 transitions. [2022-02-21 03:24:39,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:39,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:39,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:39,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 20 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2022-02-21 03:24:39,370 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-02-21 03:24:39,370 INFO L587 BuchiCegarLoop]: Abstraction has 21 states and 32 transitions. [2022-02-21 03:24:39,370 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:39,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. [2022-02-21 03:24:39,371 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:39,371 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:39,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:39,377 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:39,377 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:39,377 INFO L791 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 470#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 474#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 475#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 481#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 480#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 479#L28-3 main_~i~0#1 := main_~k~0#1; 465#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 467#L28-2 [2022-02-21 03:24:39,377 INFO L793 eck$LassoCheckResult]: Loop: 467#L28-2 assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; 467#L28-2 [2022-02-21 03:24:39,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 124343110, now seen corresponding path program 2 times [2022-02-21 03:24:39,378 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,378 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117911215] [2022-02-21 03:24:39,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,426 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:39,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,427 INFO L85 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 2 times [2022-02-21 03:24:39,427 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,427 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032653552] [2022-02-21 03:24:39,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:39,432 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:39,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,433 INFO L85 PathProgramCache]: Analyzing trace with hash -440330854, now seen corresponding path program 1 times [2022-02-21 03:24:39,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:39,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812537833] [2022-02-21 03:24:39,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:39,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,474 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 [2022-02-21 03:24:39,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {593#true} assume { :begin_inline_ULTIMATE.init } true; {593#true} is VALID [2022-02-21 03:24:39,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {593#true} is VALID [2022-02-21 03:24:39,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {593#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {593#true} is VALID [2022-02-21 03:24:39,492 INFO L290 TraceCheckUtils]: 3: Hoare triple {593#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {593#true} is VALID [2022-02-21 03:24:39,492 INFO L290 TraceCheckUtils]: 4: Hoare triple {593#true} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {593#true} is VALID [2022-02-21 03:24:39,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#true} assume !(main_~k~0#1 < main_~N~0#1 - 1); {595#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:24:39,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {595#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} main_~i~0#1 := main_~k~0#1; {596#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-21 03:24:39,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {595#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} is VALID [2022-02-21 03:24:39,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {595#(<= |ULTIMATE.start_main_~N~0#1| (+ |ULTIMATE.start_main_~k~0#1| 1))} assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; {594#false} is VALID [2022-02-21 03:24:39,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:39,495 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:39,495 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812537833] [2022-02-21 03:24:39,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812537833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:39,496 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:39,496 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:24:39,496 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539845997] [2022-02-21 03:24:39,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:39,512 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:39,512 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:39,512 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:39,512 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:39,512 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:39,512 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,512 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:39,512 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:39,512 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2022-02-21 03:24:39,512 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:39,512 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:39,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,554 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:39,554 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:39,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,572 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) [2022-02-21 03:24:39,573 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 [2022-02-21 03:24:39,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:39,609 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:39,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:24:39,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,626 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) [2022-02-21 03:24:39,627 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 [2022-02-21 03:24:39,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,686 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 [2022-02-21 03:24:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,687 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) [2022-02-21 03:24:39,688 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 [2022-02-21 03:24:39,689 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:39,689 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,847 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:39,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:39,851 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:39,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:39,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:39,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:39,852 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:39,852 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,852 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:39,852 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:39,852 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2022-02-21 03:24:39,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:39,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:39,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,899 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:39,900 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:39,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,901 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) [2022-02-21 03:24:39,901 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 [2022-02-21 03:24:39,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:39,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:39,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:39,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:39,919 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:39,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:39,921 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:39,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,922 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:39,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:24:39,924 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:39,924 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:39,924 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:39,924 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~N~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~N~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-02-21 03:24:39,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:24:39,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:39,953 INFO L390 LassoCheck]: Loop: "assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1;" [2022-02-21 03:24:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#unseeded} assume { :begin_inline_ULTIMATE.init } true; {597#unseeded} is VALID [2022-02-21 03:24:40,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {597#unseeded} is VALID [2022-02-21 03:24:40,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,005 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,006 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,006 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {597#unseeded} is VALID [2022-02-21 03:24:40,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#unseeded} main_~i~0#1 := main_~k~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,007 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,011 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#(>= oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; {610#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:40,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:40,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,020 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:40,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,043 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 39 transitions. Complement of second has 5 states. [2022-02-21 03:24:40,044 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 [2022-02-21 03:24:40,044 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:40,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2022-02-21 03:24:40,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:40,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,046 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,046 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:40,046 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:40,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:40,047 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 39 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:40,047 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:40,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,060 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:24:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,061 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:40,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#unseeded} assume { :begin_inline_ULTIMATE.init } true; {597#unseeded} is VALID [2022-02-21 03:24:40,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {597#unseeded} is VALID [2022-02-21 03:24:40,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {597#unseeded} is VALID [2022-02-21 03:24:40,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#unseeded} main_~i~0#1 := main_~k~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,110 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#(>= oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; {610#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:40,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,118 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:40,118 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,140 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 39 transitions. Complement of second has 5 states. [2022-02-21 03:24:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:40,140 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,141 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:40,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 39 transitions. [2022-02-21 03:24:40,142 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:24:40,142 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,142 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,142 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,142 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:40,142 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:40,143 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:40,143 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 39 transitions. cyclomatic complexity: 19 [2022-02-21 03:24:40,143 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:40,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:40,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 39 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,155 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2022-02-21 03:24:40,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,156 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {597#unseeded} assume { :begin_inline_ULTIMATE.init } true; {597#unseeded} is VALID [2022-02-21 03:24:40,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {597#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {597#unseeded} is VALID [2022-02-21 03:24:40,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {597#unseeded} is VALID [2022-02-21 03:24:40,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {597#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {597#unseeded} is VALID [2022-02-21 03:24:40,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {597#unseeded} main_~i~0#1 := main_~k~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {597#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {597#unseeded} is VALID [2022-02-21 03:24:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,200 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {600#(>= oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))} assume !!(main_~k~0#1 < main_~N~0#1 - 1);main_~k~0#1 := 1 + main_~k~0#1; {610#(or (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~N~0#1| (* (- 1) |ULTIMATE.start_main_~k~0#1|)))) unseeded)} is VALID [2022-02-21 03:24:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:40,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,210 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:40,210 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16 Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 32 transitions. cyclomatic complexity: 16. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 37 states and 61 transitions. Complement of second has 5 states. [2022-02-21 03:24:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:40,274 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:40,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 61 transitions. [2022-02-21 03:24:40,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:24:40,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 32 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:40,276 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:40,276 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:40,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:40,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 61 transitions. cyclomatic complexity: 32 [2022-02-21 03:24:40,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:24:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 37 letters. Loop has 37 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 32 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 61 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:40,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,285 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-02-21 03:24:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 8 letters. Loop has 1 letters. [2022-02-21 03:24:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 9 letters. Loop has 1 letters. [2022-02-21 03:24:40,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:40,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,287 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 61 transitions. cyclomatic complexity: 32 [2022-02-21 03:24:40,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:24:40,288 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 23 states and 34 transitions. [2022-02-21 03:24:40,288 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:24:40,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-02-21 03:24:40,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 34 transitions. [2022-02-21 03:24:40,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,303 INFO L681 BuchiCegarLoop]: Abstraction has 23 states and 34 transitions. [2022-02-21 03:24:40,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 34 transitions. [2022-02-21 03:24:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2022-02-21 03:24:40,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,305 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,305 INFO L87 Difference]: Start difference. First operand 23 states and 34 transitions. Second operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,306 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,306 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2022-02-21 03:24:40,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-02-21 03:24:40,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 23 states and 34 transitions. [2022-02-21 03:24:40,307 INFO L87 Difference]: Start difference. First operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 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 23 states and 34 transitions. [2022-02-21 03:24:40,307 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,308 INFO L93 Difference]: Finished difference Result 23 states and 34 transitions. [2022-02-21 03:24:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 34 transitions. [2022-02-21 03:24:40,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 20 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2022-02-21 03:24:40,309 INFO L704 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2022-02-21 03:24:40,309 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:40,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:40,312 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:40,351 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:24:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:24:40,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,358 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:40,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 03:24:40,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:24:40,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:24:40,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,359 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:24:40,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-21 03:24:40,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,360 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,360 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. Second operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,360 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,361 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:24:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 27 transitions. [2022-02-21 03:24:40,361 INFO L87 Difference]: Start difference. First operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 27 transitions. [2022-02-21 03:24:40,362 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,362 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-02-21 03:24:40,362 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2022-02-21 03:24:40,363 INFO L704 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:24:40,363 INFO L587 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2022-02-21 03:24:40,363 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:40,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2022-02-21 03:24:40,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:40,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,364 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:40,364 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:40,364 INFO L791 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 948#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 953#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 954#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 960#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 959#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 956#L28-3 main_~i~0#1 := main_~k~0#1; 942#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 944#L28-2 [2022-02-21 03:24:40,364 INFO L793 eck$LassoCheckResult]: Loop: 944#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 957#L28-3 main_~i~0#1 := main_~k~0#1; 950#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 944#L28-2 [2022-02-21 03:24:40,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,364 INFO L85 PathProgramCache]: Analyzing trace with hash 124343110, now seen corresponding path program 3 times [2022-02-21 03:24:40,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263530579] [2022-02-21 03:24:40,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,375 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,375 INFO L85 PathProgramCache]: Analyzing trace with hash 59760, now seen corresponding path program 1 times [2022-02-21 03:24:40,375 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,375 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015173553] [2022-02-21 03:24:40,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,381 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2043810827, now seen corresponding path program 4 times [2022-02-21 03:24:40,381 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17794784] [2022-02-21 03:24:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,393 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,427 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:40,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:40,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:40,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:40,427 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:40,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2022-02-21 03:24:40,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,488 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,488 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,489 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) [2022-02-21 03:24:40,490 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 [2022-02-21 03:24:40,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,510 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,510 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=-2, ULTIMATE.start_main_~k~0#1=-2, ULTIMATE.start_main_~N~0#1=-8} Honda state: {ULTIMATE.start_main_~i~0#1=-2, ULTIMATE.start_main_~k~0#1=-2, ULTIMATE.start_main_~N~0#1=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:40,527 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 [2022-02-21 03:24:40,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,529 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) [2022-02-21 03:24:40,531 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 [2022-02-21 03:24:40,532 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,532 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,553 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,553 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:40,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,570 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) [2022-02-21 03:24:40,572 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 [2022-02-21 03:24:40,572 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,573 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,594 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:40,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-02-21 03:24:40,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,611 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) [2022-02-21 03:24:40,611 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 [2022-02-21 03:24:40,613 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,613 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,635 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:24:40,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,636 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:24:40,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:40,638 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,767 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:40,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-02-21 03:24:40,771 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:40,771 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:40,771 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:40,771 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:40,771 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:40,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2022-02-21 03:24:40,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,844 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,845 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:24:40,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:40,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:40,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:40,877 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,894 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:24:40,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:40,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:40,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,904 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:40,904 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:40,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:24:40,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,932 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:24:40,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:40,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,940 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:40,941 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:40,956 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:24:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,973 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:24:40,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:40,981 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,981 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:40,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,982 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:40,982 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:40,984 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:40,985 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:40,986 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:40,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,987 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:40,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:24:40,989 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:40,989 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:40,989 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:40,989 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~m~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~m~0#1 Supporting invariants [] [2022-02-21 03:24:41,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:24:41,015 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:41,019 INFO L390 LassoCheck]: Loop: "assume !(main_~k~0#1 < main_~N~0#1 - 1);" "main_~i~0#1 := main_~k~0#1;" "assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1;" [2022-02-21 03:24:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {1061#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1061#unseeded} is VALID [2022-02-21 03:24:41,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1061#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1061#unseeded} is VALID [2022-02-21 03:24:41,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {1061#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1061#unseeded} is VALID [2022-02-21 03:24:41,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {1061#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1061#unseeded} is VALID [2022-02-21 03:24:41,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {1061#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1061#unseeded} is VALID [2022-02-21 03:24:41,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {1061#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1061#unseeded} is VALID [2022-02-21 03:24:41,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {1061#unseeded} main_~i~0#1 := main_~k~0#1; {1061#unseeded} is VALID [2022-02-21 03:24:41,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1061#unseeded} is VALID [2022-02-21 03:24:41,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1064#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:41,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} main_~i~0#1 := main_~k~0#1; {1064#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:41,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {1064#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1074#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID [2022-02-21 03:24:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:41,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-02-21 03:24:41,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:41,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,097 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:41,097 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 11 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-02-21 03:24:41,123 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 11. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Result 38 states and 49 transitions. Complement of second has 5 states. [2022-02-21 03:24:41,124 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 [2022-02-21 03:24:41,124 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. cyclomatic complexity: 11 [2022-02-21 03:24:41,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-02-21 03:24:41,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 49 transitions. [2022-02-21 03:24:41,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:41,125 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,125 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,125 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 27 transitions. cyclomatic complexity: 11 [2022-02-21 03:24:41,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:41,125 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-02-21 03:24:41,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:41,126 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 49 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:41,126 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 20 letters. Loop has 20 letters. [2022-02-21 03:24:41,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:41,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:41,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:41,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:41,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:41,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:41,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:41,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 27 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 49 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:41,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,132 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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) [2022-02-21 03:24:41,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:24:41,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:41,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 8 letters. Loop has 6 letters. [2022-02-21 03:24:41,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 49 transitions. cyclomatic complexity: 17 [2022-02-21 03:24:41,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:41,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 34 states and 45 transitions. [2022-02-21 03:24:41,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:24:41,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:24:41,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 45 transitions. [2022-02-21 03:24:41,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:41,148 INFO L681 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-02-21 03:24:41,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 45 transitions. [2022-02-21 03:24:41,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 26. [2022-02-21 03:24:41,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:41,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 45 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,149 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 45 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,149 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,149 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,150 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-02-21 03:24:41,150 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-02-21 03:24:41,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 34 states and 45 transitions. [2022-02-21 03:24:41,150 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 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 34 states and 45 transitions. [2022-02-21 03:24:41,151 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,162 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-02-21 03:24:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-02-21 03:24:41,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:41,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-02-21 03:24:41,163 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-21 03:24:41,163 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-02-21 03:24:41,163 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:24:41,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2022-02-21 03:24:41,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:41,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,163 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:41,163 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:41,164 INFO L791 eck$LassoCheckResult]: Stem: 1155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1160#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 1157#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 1158#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1171#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1165#L28-3 main_~i~0#1 := main_~k~0#1; 1166#L25-2 assume !(main_~j~0#1 < main_~m~0#1); 1170#L25-3 main_~i~0#1 := 1 + main_~i~0#1; 1172#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 1169#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1162#L28-2 [2022-02-21 03:24:41,164 INFO L793 eck$LassoCheckResult]: Loop: 1162#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1163#L28-3 main_~i~0#1 := main_~k~0#1; 1176#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1162#L28-2 [2022-02-21 03:24:41,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2043760173, now seen corresponding path program 2 times [2022-02-21 03:24:41,164 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,164 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505389429] [2022-02-21 03:24:41,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,186 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 59760, now seen corresponding path program 2 times [2022-02-21 03:24:41,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241347032] [2022-02-21 03:24:41,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,206 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,207 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,208 INFO L85 PathProgramCache]: Analyzing trace with hash 202955716, now seen corresponding path program 3 times [2022-02-21 03:24:41,208 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,208 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056144716] [2022-02-21 03:24:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#true} assume { :begin_inline_ULTIMATE.init } true; {1316#true} is VALID [2022-02-21 03:24:41,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1316#true} is VALID [2022-02-21 03:24:41,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {1316#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1316#true} is VALID [2022-02-21 03:24:41,248 INFO L290 TraceCheckUtils]: 3: Hoare triple {1316#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:41,248 INFO L290 TraceCheckUtils]: 4: Hoare triple {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_~i~0#1 := main_~k~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} main_~i~0#1 := 1 + main_~i~0#1; {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1321#(<= |ULTIMATE.start_main_~m~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:24:41,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {1321#(<= |ULTIMATE.start_main_~m~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} main_~i~0#1 := main_~k~0#1; {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1317#false} is VALID [2022-02-21 03:24:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:41,252 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:41,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056144716] [2022-02-21 03:24:41,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056144716] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:41,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781796288] [2022-02-21 03:24:41,252 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:24:41,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:41,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,253 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) [2022-02-21 03:24:41,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-02-21 03:24:41,286 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-21 03:24:41,286 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:41,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#true} assume { :begin_inline_ULTIMATE.init } true; {1316#true} is VALID [2022-02-21 03:24:41,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1316#true} is VALID [2022-02-21 03:24:41,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1316#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1316#true} is VALID [2022-02-21 03:24:41,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {1316#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:41,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_~i~0#1 := main_~k~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} main_~i~0#1 := 1 + main_~i~0#1; {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1353#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} is VALID [2022-02-21 03:24:41,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {1353#(and (<= 0 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} is VALID [2022-02-21 03:24:41,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} is VALID [2022-02-21 03:24:41,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} main_~i~0#1 := main_~k~0#1; {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} is VALID [2022-02-21 03:24:41,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {1357#(and (<= 1 |ULTIMATE.start_main_~j~0#1|) (<= |ULTIMATE.start_main_~m~0#1| 1))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1317#false} is VALID [2022-02-21 03:24:41,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:41,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:41,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1317#false} is VALID [2022-02-21 03:24:41,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} main_~i~0#1 := main_~k~0#1; {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {1321#(<= |ULTIMATE.start_main_~m~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1322#(<= |ULTIMATE.start_main_~m~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-21 03:24:41,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1321#(<= |ULTIMATE.start_main_~m~0#1| (+ |ULTIMATE.start_main_~j~0#1| 1))} is VALID [2022-02-21 03:24:41,471 INFO L290 TraceCheckUtils]: 8: Hoare triple {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} main_~i~0#1 := 1 + main_~i~0#1; {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~j~0#1 < main_~m~0#1); {1320#(<= |ULTIMATE.start_main_~m~0#1| 1)} is VALID [2022-02-21 03:24:41,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} main_~i~0#1 := main_~k~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,475 INFO L290 TraceCheckUtils]: 4: Hoare triple {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1319#(<= |ULTIMATE.start_main_~j~0#1| 1)} is VALID [2022-02-21 03:24:41,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {1316#true} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1318#(<= |ULTIMATE.start_main_~j~0#1| 0)} is VALID [2022-02-21 03:24:41,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {1316#true} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1316#true} is VALID [2022-02-21 03:24:41,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {1316#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1316#true} is VALID [2022-02-21 03:24:41,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {1316#true} assume { :begin_inline_ULTIMATE.init } true; {1316#true} is VALID [2022-02-21 03:24:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:41,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781796288] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:41,476 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:41,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2022-02-21 03:24:41,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923486310] [2022-02-21 03:24:41,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:41,500 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,500 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,500 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,500 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:41,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,501 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2022-02-21 03:24:41,501 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,501 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,564 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,564 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,566 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:24:41,569 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,569 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,608 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,612 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:41,612 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:24:41,748 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:41,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,752 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,752 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,752 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,752 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,752 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:41,752 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,752 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,752 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,752 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2022-02-21 03:24:41,752 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,752 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:41,823 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,823 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:41,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,824 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:24:41,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:41,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,837 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:41,839 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:41,839 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:41,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,841 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:24:41,843 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:41,843 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:41,843 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:41,843 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~m~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~m~0#1 Supporting invariants [] [2022-02-21 03:24:41,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,876 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:41,880 INFO L390 LassoCheck]: Loop: "assume !(main_~k~0#1 < main_~N~0#1 - 1);" "main_~i~0#1 := main_~k~0#1;" "assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1;" [2022-02-21 03:24:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {1403#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1403#unseeded} is VALID [2022-02-21 03:24:41,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1403#unseeded} is VALID [2022-02-21 03:24:41,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:41,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:41,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:41,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {1403#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1403#unseeded} is VALID [2022-02-21 03:24:41,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#unseeded} main_~i~0#1 := main_~k~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:41,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#unseeded} assume !(main_~j~0#1 < main_~m~0#1); {1403#unseeded} is VALID [2022-02-21 03:24:41,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:41,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:41,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:41,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,967 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:41,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} main_~i~0#1 := main_~k~0#1; {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:41,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1416#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID [2022-02-21 03:24:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:41,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:41,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:41,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,985 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:41,985 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,003 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 46 states and 63 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,003 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 [2022-02-21 03:24:42,003 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,004 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,004 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,004 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2022-02-21 03:24:42,005 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:42,005 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,005 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,005 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:42,005 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,006 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 63 transitions. cyclomatic complexity: 25 [2022-02-21 03:24:42,006 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:42,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,012 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:24:42,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,013 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {1403#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1403#unseeded} is VALID [2022-02-21 03:24:42,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,081 INFO L290 TraceCheckUtils]: 4: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {1403#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1403#unseeded} is VALID [2022-02-21 03:24:42,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#unseeded} main_~i~0#1 := main_~k~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#unseeded} assume !(main_~j~0#1 < main_~m~0#1); {1403#unseeded} is VALID [2022-02-21 03:24:42,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:42,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} main_~i~0#1 := main_~k~0#1; {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:42,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1416#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID [2022-02-21 03:24:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:42,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:42,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,110 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:42,110 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,129 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 46 states and 63 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,129 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 [2022-02-21 03:24:42,129 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 63 transitions. [2022-02-21 03:24:42,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:42,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,130 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:42,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,131 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 63 transitions. cyclomatic complexity: 25 [2022-02-21 03:24:42,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:42,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 63 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,137 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-02-21 03:24:42,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,138 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,169 INFO L290 TraceCheckUtils]: 0: Hoare triple {1403#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1403#unseeded} is VALID [2022-02-21 03:24:42,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1403#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {1403#unseeded} assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,170 INFO L290 TraceCheckUtils]: 3: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1403#unseeded} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1403#unseeded} is VALID [2022-02-21 03:24:42,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {1403#unseeded} main_~i~0#1 := main_~k~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {1403#unseeded} assume !(main_~j~0#1 < main_~m~0#1); {1403#unseeded} is VALID [2022-02-21 03:24:42,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {1403#unseeded} main_~i~0#1 := 1 + main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {1403#unseeded} assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; {1403#unseeded} is VALID [2022-02-21 03:24:42,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {1403#unseeded} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1403#unseeded} is VALID [2022-02-21 03:24:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !(main_~k~0#1 < main_~N~0#1 - 1); {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:42,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} main_~i~0#1 := main_~k~0#1; {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID [2022-02-21 03:24:42,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {1406#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; {1416#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID [2022-02-21 03:24:42,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:42,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:42,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,194 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:24:42,194 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,214 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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 50 states and 70 transitions. Complement of second has 4 states. [2022-02-21 03:24:42,214 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 [2022-02-21 03:24:42,214 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,215 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 70 transitions. [2022-02-21 03:24:42,215 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 03:24:42,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 36 transitions. cyclomatic complexity: 16 [2022-02-21 03:24:42,215 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:42,215 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,216 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,216 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 50 states and 70 transitions. cyclomatic complexity: 28 [2022-02-21 03:24:42,216 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:24:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 50 letters. Loop has 50 letters. [2022-02-21 03:24:42,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:24:42,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 36 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 50 states and 70 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:42,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,222 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2022-02-21 03:24:42,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:24:42,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:42,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:42,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 70 transitions. cyclomatic complexity: 28 [2022-02-21 03:24:42,224 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2022-02-21 03:24:42,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 36 states and 49 transitions. [2022-02-21 03:24:42,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2022-02-21 03:24:42,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-02-21 03:24:42,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 49 transitions. [2022-02-21 03:24:42,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:42,225 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 49 transitions. [2022-02-21 03:24:42,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 49 transitions. [2022-02-21 03:24:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 25. [2022-02-21 03:24:42,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:42,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 49 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,226 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 49 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,226 INFO L87 Difference]: Start difference. First operand 36 states and 49 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,226 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,227 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-21 03:24:42,227 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-21 03:24:42,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states and 49 transitions. [2022-02-21 03:24:42,228 INFO L87 Difference]: Start difference. First operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 states and 49 transitions. [2022-02-21 03:24:42,228 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,228 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-21 03:24:42,229 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-21 03:24:42,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:42,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:42,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-02-21 03:24:42,229 INFO L704 BuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-02-21 03:24:42,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:42,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-21 03:24:42,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-21 03:24:42,230 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:42,344 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2022-02-21 03:24:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-21 03:24:42,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:42,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2022-02-21 03:24:42,358 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2022-02-21 03:24:42,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 48 transitions. [2022-02-21 03:24:42,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-02-21 03:24:42,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2022-02-21 03:24:42,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 48 transitions. [2022-02-21 03:24:42,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:42,363 INFO L681 BuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-02-21 03:24:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 48 transitions. [2022-02-21 03:24:42,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2022-02-21 03:24:42,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:42,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 48 transitions. Second 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) [2022-02-21 03:24:42,367 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 48 transitions. Second 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) [2022-02-21 03:24:42,367 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second 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) [2022-02-21 03:24:42,367 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,368 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-02-21 03:24:42,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-21 03:24:42,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,372 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 39 states and 48 transitions. [2022-02-21 03:24:42,372 INFO L87 Difference]: Start difference. First 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) Second operand 39 states and 48 transitions. [2022-02-21 03:24:42,372 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,374 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-02-21 03:24:42,374 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-02-21 03:24:42,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:42,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:42,374 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) [2022-02-21 03:24:42,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-02-21 03:24:42,375 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-02-21 03:24:42,375 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-02-21 03:24:42,375 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:24:42,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2022-02-21 03:24:42,375 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2022-02-21 03:24:42,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,376 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:24:42,376 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2022-02-21 03:24:42,376 INFO L791 eck$LassoCheckResult]: Stem: 1932#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_~i~0#1, main_~j~0#1, main_~k~0#1, main_~m~0#1, main_~n~0#1, main_~N~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~m~0#1;havoc main_~n~0#1;havoc main_~N~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~j~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~k~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~n~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~m~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;main_~N~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1936#L21 assume (0 <= main_~n~0#1 && 0 <= main_~m~0#1) && 0 <= main_~N~0#1;main_~i~0#1 := 0; 1937#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 1949#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1947#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1940#L28-3 main_~i~0#1 := main_~k~0#1; 1930#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1931#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1944#L28-3 [2022-02-21 03:24:42,376 INFO L793 eck$LassoCheckResult]: Loop: 1944#L28-3 main_~i~0#1 := main_~k~0#1; 1954#L25-2 assume !(main_~j~0#1 < main_~m~0#1); 1953#L25-3 main_~i~0#1 := 1 + main_~i~0#1; 1952#L23-2 assume !!(main_~i~0#1 < main_~n~0#1);main_~j~0#1 := 0; 1950#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1945#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1940#L28-3 main_~i~0#1 := main_~k~0#1; 1930#L25-2 assume !!(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 1 + main_~j~0#1;main_~k~0#1 := main_~i~0#1; 1931#L28-2 assume !(main_~k~0#1 < main_~N~0#1 - 1); 1944#L28-3 [2022-02-21 03:24:42,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,376 INFO L85 PathProgramCache]: Analyzing trace with hash -440330856, now seen corresponding path program 5 times [2022-02-21 03:24:42,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190738042] [2022-02-21 03:24:42,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,395 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,414 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1332666324, now seen corresponding path program 1 times [2022-02-21 03:24:42,415 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,415 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979295480] [2022-02-21 03:24:42,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,420 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,427 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -779525003, now seen corresponding path program 4 times [2022-02-21 03:24:42,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694240182] [2022-02-21 03:24:42,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,446 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,451 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,528 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,529 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,529 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,529 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,529 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:42,529 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,529 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,529 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,529 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2022-02-21 03:24:42,530 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,530 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,597 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,597 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:42,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,598 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:24:42,600 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,600 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,611 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,611 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-02-21 03:24:42,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,628 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:24:42,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,641 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=2, ULTIMATE.start_main_~m~0#1=2} Honda state: {ULTIMATE.start_main_~j~0#1=2, ULTIMATE.start_main_~m~0#1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:24:42,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,659 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-02-21 03:24:42,661 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,678 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,678 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,695 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-02-21 03:24:42,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-02-21 03:24:42,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,728 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-02-21 03:24:42,730 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,730 INFO L160 nArgumentSynthesizer]: Using integer mode.