./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.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-Fig1.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 30e0974778487c3ac56035f1f8ab25ce73456d36b8987ec761ccfaf99f917331 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:32,743 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:32,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:32,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:32,784 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:32,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:32,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:32,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:32,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:32,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:32,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:32,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:32,799 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:32,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:32,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:32,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:32,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:32,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:32,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:32,812 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:32,814 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:32,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:32,816 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:32,817 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:32,820 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:32,820 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:32,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:32,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:32,823 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:32,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:32,824 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:32,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:32,826 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:32,827 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:32,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:32,828 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:32,828 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:32,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:32,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:32,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:32,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:32,831 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:32,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:32,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:32,857 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:32,858 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:32,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:32,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:32,859 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:32,859 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:32,859 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:32,859 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:32,860 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:32,860 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:32,860 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:32,861 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:32,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:32,862 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:32,862 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:32,862 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:32,862 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:32,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:32,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:32,863 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:32,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:32,864 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:32,864 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 -> 30e0974778487c3ac56035f1f8ab25ce73456d36b8987ec761ccfaf99f917331 [2022-02-21 03:24:33,071 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:33,088 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:33,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:33,092 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:33,093 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:33,094 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2022-02-21 03:24:33,149 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181d342d/1595e394b511470b83aea0315af07e1a/FLAG3a8395798 [2022-02-21 03:24:33,524 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:33,524 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2022-02-21 03:24:33,531 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181d342d/1595e394b511470b83aea0315af07e1a/FLAG3a8395798 [2022-02-21 03:24:33,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4181d342d/1595e394b511470b83aea0315af07e1a [2022-02-21 03:24:33,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:33,547 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:33,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:33,550 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:33,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:33,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46620599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33, skipping insertion in model container [2022-02-21 03:24:33,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:33,567 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:33,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:33,717 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:33,732 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:33,739 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:33,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33 WrapperNode [2022-02-21 03:24:33,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:33,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:33,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:33,742 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:33,746 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:33" (1/1) ... [2022-02-21 03:24:33,750 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:33" (1/1) ... [2022-02-21 03:24:33,764 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 27 [2022-02-21 03:24:33,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:33,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:33,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:33,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:33,770 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:33" (1/1) ... [2022-02-21 03:24:33,770 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:33" (1/1) ... [2022-02-21 03:24:33,770 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:33" (1/1) ... [2022-02-21 03:24:33,771 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:33" (1/1) ... [2022-02-21 03:24:33,773 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:33" (1/1) ... [2022-02-21 03:24:33,778 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:33" (1/1) ... [2022-02-21 03:24:33,779 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:33" (1/1) ... [2022-02-21 03:24:33,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:33,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:33,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:33,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:33,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (1/1) ... [2022-02-21 03:24:33,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:33,821 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:33,847 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:33,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:33,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:33,907 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:33,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:34,002 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:34,006 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:34,006 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:24:34,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34 BoogieIcfgContainer [2022-02-21 03:24:34,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:34,008 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:34,008 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:34,011 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:34,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:33" (1/3) ... [2022-02-21 03:24:34,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dba5e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:34, skipping insertion in model container [2022-02-21 03:24:34,012 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:33" (2/3) ... [2022-02-21 03:24:34,013 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7dba5e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:34, skipping insertion in model container [2022-02-21 03:24:34,013 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:34,013 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34" (3/3) ... [2022-02-21 03:24:34,014 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2022-02-21 03:24:34,044 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:34,044 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:34,044 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:34,044 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:34,044 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:34,044 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:34,044 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:34,045 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:34,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:34,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:34,065 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:34,065 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:34,068 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:34,069 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:34,069 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:34,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:34,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:34,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:34,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:34,072 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:24:34,072 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:34,076 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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 6#L18-2true [2022-02-21 03:24:34,076 INFO L793 eck$LassoCheckResult]: Loop: 6#L18-2true assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 12#L19true assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 3#L19-2true main_~y~0#1 := main_~y~0#1 - 1; 6#L18-2true [2022-02-21 03:24:34,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,080 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:24:34,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543306703] [2022-02-21 03:24:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,174 INFO L85 PathProgramCache]: Analyzing trace with hash 41292, now seen corresponding path program 1 times [2022-02-21 03:24:34,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,175 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497008971] [2022-02-21 03:24:34,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,192 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,194 INFO L85 PathProgramCache]: Analyzing trace with hash 28700234, now seen corresponding path program 1 times [2022-02-21 03:24:34,194 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:34,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871197818] [2022-02-21 03:24:34,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:34,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:34,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,216 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:34,222 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:34,304 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:34,304 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:34,304 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:34,304 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:34,305 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:34,305 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,305 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:34,305 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:34,305 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2022-02-21 03:24:34,305 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:34,305 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:34,326 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:34,333 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:34,339 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:34,354 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:34,359 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:34,469 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:34,470 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:34,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,474 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:34,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,479 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,479 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:34,501 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:34,501 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:34,525 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:34,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,527 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:34,528 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:34,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,530 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,544 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:34,544 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:34,573 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:34,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,577 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:34,579 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:34,581 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:34,581 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,607 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:34,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,610 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:34,614 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:34,628 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:34,628 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:34,671 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:34,677 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:34,678 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:34,678 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:34,678 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:34,678 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:34,678 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:34,678 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,678 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:34,678 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:34,678 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2022-02-21 03:24:34,678 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:34,678 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:34,680 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:34,685 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:34,690 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:34,700 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:34,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:34,779 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:34,783 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:34,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,786 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:34,788 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:34,789 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:34,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:34,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:34,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:34,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:34,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:34,804 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:34,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:34,841 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:34,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,842 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:34,844 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:34,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:34,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:34,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:34,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:34,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:34,854 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:34,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:34,866 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:34,888 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:34,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,891 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:34,892 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:34,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:34,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:34,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:34,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:34,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:34,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:34,901 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:34,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:34,906 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:34,909 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:34,909 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:34,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:34,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:34,912 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:34,913 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:34,916 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:34,916 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:34,916 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:34,916 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 2*ULTIMATE.start_main_~y~0#1 + 1 Supporting invariants [] [2022-02-21 03:24:34,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:24:34,943 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:34,947 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" "main_~y~0#1 := main_~y~0#1 - 1;" [2022-02-21 03:24:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:34,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:34,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:34,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:34,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#unseeded} assume { :begin_inline_ULTIMATE.init } true; {21#unseeded} is VALID [2022-02-21 03:24:34,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {21#unseeded} is VALID [2022-02-21 03:24:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,001 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:35,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {42#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:35,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {42#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:35,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#(and (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1)) (<= 0 |ULTIMATE.start_main_~y~0#1|))} main_~y~0#1 := main_~y~0#1 - 1; {34#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~y~0#1|) 1))))} is VALID [2022-02-21 03:24:35,043 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:35,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:35,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,079 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:35,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,142 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 38 states and 55 transitions. Complement of second has 8 states. [2022-02-21 03:24:35,143 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:35,143 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:35,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,146 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,149 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:35,150 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,150 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,150 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 55 transitions. [2022-02-21 03:24:35,151 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,153 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,155 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:35,155 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:35,157 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:35,157 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 55 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:35,158 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:35,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:35,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:35,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:35,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:35,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:24:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:24:35,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:35,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:35,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:35,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:35,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:35,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:35,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:35,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:35,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:35,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:35,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:35,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:35,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:35,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:35,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 11 states, 10 states have (on average 1.5) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 55 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:35,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,198 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:35,202 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:35,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:35,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2022-02-21 03:24:35,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:24:35,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:24:35,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 27 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:24:35,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,208 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 55 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:35,210 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 15 states and 21 transitions. [2022-02-21 03:24:35,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:35,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-02-21 03:24:35,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 21 transitions. [2022-02-21 03:24:35,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:35,214 INFO L681 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 03:24:35,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 21 transitions. [2022-02-21 03:24:35,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-21 03:24:35,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:35,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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:35,235 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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:35,237 INFO L87 Difference]: Start difference. First operand 15 states and 21 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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:35,239 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:35,242 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 03:24:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:35,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:35,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:35,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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 21 transitions. [2022-02-21 03:24:35,244 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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 21 transitions. [2022-02-21 03:24:35,244 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:35,245 INFO L93 Difference]: Finished difference Result 15 states and 21 transitions. [2022-02-21 03:24:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:35,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:35,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:35,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:35,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:35,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 14 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:35,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 21 transitions. [2022-02-21 03:24:35,249 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 03:24:35,249 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 21 transitions. [2022-02-21 03:24:35,249 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:35,249 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:35,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,250 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,250 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:35,250 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:35,250 INFO L791 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 103#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 104#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 105#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 107#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 108#L20-2 [2022-02-21 03:24:35,251 INFO L793 eck$LassoCheckResult]: Loop: 108#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 108#L20-2 [2022-02-21 03:24:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,251 INFO L85 PathProgramCache]: Analyzing trace with hash 28699761, now seen corresponding path program 1 times [2022-02-21 03:24:35,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607001803] [2022-02-21 03:24:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,261 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,267 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 1 times [2022-02-21 03:24:35,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685198891] [2022-02-21 03:24:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,272 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,275 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,275 INFO L85 PathProgramCache]: Analyzing trace with hash 889692614, now seen corresponding path program 2 times [2022-02-21 03:24:35,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:35,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322937101] [2022-02-21 03:24:35,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:35,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,284 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:35,291 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:35,309 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:35,309 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:35,309 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:35,309 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:35,310 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:35,310 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,310 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:35,310 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:35,310 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2022-02-21 03:24:35,310 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:35,310 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:35,311 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:35,314 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:35,320 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:35,323 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:35,377 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:35,377 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:35,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,379 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:35,409 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:35,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:35,410 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,432 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:35,432 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:35,457 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:35,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,467 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:35,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:35,471 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,471 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:35,521 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:24:35,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,523 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:35,524 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:35,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:35,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:35,650 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:35,653 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:35,654 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:35,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:35,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:35,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:35,654 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:35,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:35,654 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:35,654 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2022-02-21 03:24:35,654 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:35,654 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:35,655 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:35,658 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:35,663 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:35,666 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:35,720 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:35,720 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:35,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,736 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:35,737 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:35,739 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:35,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:35,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:35,762 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:35,781 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:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,793 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:35,795 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:35,800 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:35,807 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:35,808 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:35,808 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:35,808 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:35,808 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:35,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:35,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:35,822 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:35,824 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:35,824 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:35,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:35,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:35,826 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:35,826 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:35,827 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:35,827 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:35,828 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:35,828 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~m~0#1) = -2*ULTIMATE.start_main_~y~0#1 + 2*ULTIMATE.start_main_~m~0#1 + 1 Supporting invariants [] [2022-02-21 03:24:35,851 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:35,868 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:35,872 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1;" [2022-02-21 03:24:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:35,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {188#unseeded} assume { :begin_inline_ULTIMATE.init } true; {188#unseeded} is VALID [2022-02-21 03:24:35,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {188#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {188#unseeded} is VALID [2022-02-21 03:24:35,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {188#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {188#unseeded} is VALID [2022-02-21 03:24:35,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {188#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {188#unseeded} is VALID [2022-02-21 03:24:35,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {188#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {188#unseeded} is VALID [2022-02-21 03:24:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,940 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:35,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:35,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {201#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:35,944 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:35,945 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:35,962 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:35,962 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:35,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:35,962 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:35,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8 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:35,994 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 21 transitions. cyclomatic complexity: 8. 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 26 states and 40 transitions. Complement of second has 6 states. [2022-02-21 03:24:35,994 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:35,994 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:35,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:35,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,994 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:35,995 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:35,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2022-02-21 03:24:35,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:35,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:35,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:35,997 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:35,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:35,998 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:35,999 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:35,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:35,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 40 transitions. cyclomatic complexity: 18 [2022-02-21 03:24:36,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:36,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,000 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:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,000 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:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 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:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 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 26 letters. Loop has 26 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 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 15 letters. Loop has 15 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:36,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,001 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:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 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:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 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:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,002 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:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 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:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 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 5 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:36,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,003 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 2 letters. Loop has 1 letters. [2022-02-21 03:24:36,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:36,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,004 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:36,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,025 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:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,028 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:36,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,028 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:36,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,029 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:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:24:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:24:36,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,030 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 1 letters. [2022-02-21 03:24:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:24:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,030 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 5 letters. [2022-02-21 03:24:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 40 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:36,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,031 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:36,031 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:36,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2022-02-21 03:24:36,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 1 letters. [2022-02-21 03:24:36,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:24:36,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:36,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 40 transitions. cyclomatic complexity: 18 [2022-02-21 03:24:36,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 19 states and 27 transitions. [2022-02-21 03:24:36,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:24:36,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:24:36,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 27 transitions. [2022-02-21 03:24:36,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:36,035 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 27 transitions. [2022-02-21 03:24:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 27 transitions. [2022-02-21 03:24:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-02-21 03:24:36,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:36,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,036 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,036 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,037 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,038 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 03:24:36,038 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:24:36,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 03:24:36,038 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states and 27 transitions. [2022-02-21 03:24:36,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,040 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2022-02-21 03:24:36,040 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2022-02-21 03:24:36,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:36,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:36,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 16 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 25 transitions. [2022-02-21 03:24:36,041 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 03:24:36,041 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 25 transitions. [2022-02-21 03:24:36,041 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:36,041 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. [2022-02-21 03:24:36,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,042 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,042 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,042 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:24:36,042 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:36,042 INFO L791 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 257#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 266#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 259#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 268#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 267#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 262#L20-3 [2022-02-21 03:24:36,042 INFO L793 eck$LassoCheckResult]: Loop: 262#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 252#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 253#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 258#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 261#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 262#L20-3 [2022-02-21 03:24:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,043 INFO L85 PathProgramCache]: Analyzing trace with hash 889692612, now seen corresponding path program 1 times [2022-02-21 03:24:36,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754321929] [2022-02-21 03:24:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,050 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,054 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,055 INFO L85 PathProgramCache]: Analyzing trace with hash 54498765, now seen corresponding path program 1 times [2022-02-21 03:24:36,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044561894] [2022-02-21 03:24:36,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,066 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,066 INFO L85 PathProgramCache]: Analyzing trace with hash -476736022, now seen corresponding path program 1 times [2022-02-21 03:24:36,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,067 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123041686] [2022-02-21 03:24:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,082 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,118 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,119 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,119 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,119 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,119 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:36,119 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,119 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,119 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,119 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2022-02-21 03:24:36,119 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,119 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,121 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,127 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,130 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,132 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,136 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,220 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,220 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:36,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,222 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:36,236 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:36,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,237 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,287 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:36,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,290 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:36,291 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:36,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:36,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,396 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:36,400 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:36,400 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,400 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,400 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,400 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,400 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:36,400 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,400 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,400 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,400 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2022-02-21 03:24:36,400 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,400 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,401 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,411 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,415 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,418 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,423 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,514 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,514 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:36,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,535 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:36,536 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:36,537 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:36,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:36,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:36,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:36,544 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:24:36,544 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:36,546 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:24:36,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:36,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:36,564 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:36,564 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:36,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,565 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:36,566 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:36,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:36,567 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:36,567 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:36,567 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:24:36,585 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:36,594 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:36,597 INFO L390 LassoCheck]: Loop: "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;" [2022-02-21 03:24:36,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:36,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#unseeded} assume { :begin_inline_ULTIMATE.init } true; {358#unseeded} is VALID [2022-02-21 03:24:36,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {358#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {358#unseeded} is VALID [2022-02-21 03:24:36,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {358#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {358#unseeded} is VALID [2022-02-21 03:24:36,636 INFO L290 TraceCheckUtils]: 3: Hoare triple {358#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {358#unseeded} is VALID [2022-02-21 03:24:36,636 INFO L290 TraceCheckUtils]: 4: Hoare triple {358#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {358#unseeded} is VALID [2022-02-21 03:24:36,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {358#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {358#unseeded} is VALID [2022-02-21 03:24:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:36,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:36,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {361#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~x~0#1 := main_~x~0#1 - 1; {361#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:24:36,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {394#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:36,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {394#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {398#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:36,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {398#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:36,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {398#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {371#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:36,717 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:36,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,725 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:36,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,725 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:36,725 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 25 transitions. cyclomatic complexity: 11 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,758 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 25 transitions. cyclomatic complexity: 11. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 47 states and 69 transitions. Complement of second has 8 states. [2022-02-21 03:24:36,759 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:36,759 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:36,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 25 transitions. cyclomatic complexity: 11 [2022-02-21 03:24:36,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,760 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:24:36,760 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 69 transitions. [2022-02-21 03:24:36,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,762 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 25 transitions. cyclomatic complexity: 11 [2022-02-21 03:24:36,762 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:36,763 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,763 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2022-02-21 03:24:36,763 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:36,764 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 69 transitions. cyclomatic complexity: 29 [2022-02-21 03:24:36,764 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:36,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 3 letters. [2022-02-21 03:24:36,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 1 letters. [2022-02-21 03:24:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:36,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:24:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 47 letters. Loop has 47 letters. [2022-02-21 03:24:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:24:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:24:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 17 letters. Loop has 17 letters. [2022-02-21 03:24:36,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 17 letters. Loop has 17 letters. [2022-02-21 03:24:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 5 letters. Loop has 5 letters. [2022-02-21 03:24:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:24:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:24:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 1 letters. [2022-02-21 03:24:36,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 10 letters. Loop has 1 letters. [2022-02-21 03:24:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 7 letters. Loop has 3 letters. [2022-02-21 03:24:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:24:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:24:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 1 letters. [2022-02-21 03:24:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:24:36,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:36,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 3 letters. [2022-02-21 03:24:36,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:36,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:36,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 1 letters. [2022-02-21 03:24:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:36,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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 5 letters. [2022-02-21 03:24:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:36,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:36,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 25 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:36,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 69 transitions. cyclomatic complexity: 29 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:36,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,794 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:36,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 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:36,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-02-21 03:24:36,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 5 letters. [2022-02-21 03:24:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 6 letters. Loop has 10 letters. [2022-02-21 03:24:36,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:36,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. cyclomatic complexity: 29 [2022-02-21 03:24:36,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 33 states and 47 transitions. [2022-02-21 03:24:36,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-02-21 03:24:36,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2022-02-21 03:24:36,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 47 transitions. [2022-02-21 03:24:36,799 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:36,799 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 47 transitions. [2022-02-21 03:24:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 47 transitions. [2022-02-21 03:24:36,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:36,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-02-21 03:24:36,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:36,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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,804 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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,804 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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,804 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,805 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2022-02-21 03:24:36,805 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-02-21 03:24:36,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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 33 states and 47 transitions. [2022-02-21 03:24:36,806 INFO L87 Difference]: Start difference. First operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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 33 states and 47 transitions. [2022-02-21 03:24:36,806 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:36,808 INFO L93 Difference]: Finished difference Result 33 states and 47 transitions. [2022-02-21 03:24:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2022-02-21 03:24:36,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:36,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:36,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:36,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:36,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 0 states have call successors, (0), 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,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-02-21 03:24:36,809 INFO L704 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-02-21 03:24:36,810 INFO L587 BuchiCegarLoop]: Abstraction has 31 states and 45 transitions. [2022-02-21 03:24:36,810 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:36,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. [2022-02-21 03:24:36,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:36,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:36,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:36,811 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1] [2022-02-21 03:24:36,811 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:24:36,811 INFO L791 eck$LassoCheckResult]: Stem: 467#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 468#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 469#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 470#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 479#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 488#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 473#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 465#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 466#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 492#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 475#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 476#L20-2 [2022-02-21 03:24:36,811 INFO L793 eck$LassoCheckResult]: Loop: 476#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 476#L20-2 [2022-02-21 03:24:36,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash -476736020, now seen corresponding path program 2 times [2022-02-21 03:24:36,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398102402] [2022-02-21 03:24:36,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,826 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,826 INFO L85 PathProgramCache]: Analyzing trace with hash 54, now seen corresponding path program 2 times [2022-02-21 03:24:36,827 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241413032] [2022-02-21 03:24:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,831 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1893914709, now seen corresponding path program 3 times [2022-02-21 03:24:36,832 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:36,832 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529861509] [2022-02-21 03:24:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:36,845 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:36,858 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:36,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:36,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:36,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:36,859 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:36,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:36,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:36,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2022-02-21 03:24:36,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:36,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:36,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:36,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:36,864 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,866 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,915 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:36,916 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:36,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,928 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:36,930 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:36,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,931 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,944 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,944 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet2#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:36,962 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:36,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:36,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:36,964 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:36,969 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:36,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:36,982 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:36,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:36,987 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:37,004 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:37,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,006 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:37,007 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:37,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:37,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,020 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:37,021 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:37,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:24:37,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,038 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:37,039 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:37,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:37,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,082 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:37,083 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:37,084 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:37,084 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:37,228 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:37,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-02-21 03:24:37,234 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:37,234 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:37,234 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:37,234 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:37,234 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:37,234 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,234 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:37,234 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:37,234 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2022-02-21 03:24:37,234 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:37,234 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:37,235 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,239 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,241 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,244 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,314 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:37,314 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:37,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,315 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:37,336 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:37,337 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,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:37,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:37,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:37,370 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:24:37,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:37,373 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:24:37,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:37,421 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:37,456 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:37,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,467 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:37,469 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:37,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:37,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:37,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:37,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:37,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:37,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:37,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:37,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:37,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:37,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,514 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:37,516 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:37,517 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,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:37,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:37,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:37,524 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:37,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:37,525 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:37,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:37,545 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:37,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,547 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:37,548 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:37,549 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,556 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:37,556 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:37,556 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:37,556 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:37,556 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:37,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:37,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:37,571 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:37,573 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:37,573 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:37,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:37,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:37,588 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:37,589 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:37,641 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:37,641 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:37,641 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:37,641 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~m~0#1) = -2*ULTIMATE.start_main_~y~0#1 + 2*ULTIMATE.start_main_~m~0#1 + 1 Supporting invariants [] [2022-02-21 03:24:37,659 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:37,665 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:37,671 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1;" [2022-02-21 03:24:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#unseeded} assume { :begin_inline_ULTIMATE.init } true; {634#unseeded} is VALID [2022-02-21 03:24:37,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {634#unseeded} is VALID [2022-02-21 03:24:37,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,719 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {647#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:37,722 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,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,727 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:37,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,727 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:37,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,748 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 38 states and 54 transitions. Complement of second has 5 states. [2022-02-21 03:24:37,749 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:37,749 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:37,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 54 transitions. [2022-02-21 03:24:37,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:37,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,751 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,751 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,752 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:37,752 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:37,752 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 54 transitions. cyclomatic complexity: 22 [2022-02-21 03:24:37,753 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 3 letters. [2022-02-21 03:24:37,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 5 letters. [2022-02-21 03:24:37,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:24:37,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 5 letters. [2022-02-21 03:24:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:24:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,764 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:24:37,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,765 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:37,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#unseeded} assume { :begin_inline_ULTIMATE.init } true; {634#unseeded} is VALID [2022-02-21 03:24:37,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {634#unseeded} is VALID [2022-02-21 03:24:37,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,816 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,819 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {647#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:37,820 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,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,824 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:37,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,825 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:37,825 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,843 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 38 states and 54 transitions. Complement of second has 5 states. [2022-02-21 03:24:37,844 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:37,844 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:37,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 54 transitions. [2022-02-21 03:24:37,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:24:37,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,852 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,867 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,867 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,868 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:24:37,868 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:37,868 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 38 states and 54 transitions. cyclomatic complexity: 22 [2022-02-21 03:24:37,869 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 38 letters. Loop has 38 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 3 letters. [2022-02-21 03:24:37,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:37,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 5 letters. [2022-02-21 03:24:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:24:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 5 letters. [2022-02-21 03:24:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 12 letters. Loop has 5 letters. [2022-02-21 03:24:37,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 38 states and 54 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,880 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,881 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:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2022-02-21 03:24:37,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,885 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#unseeded} assume { :begin_inline_ULTIMATE.init } true; {634#unseeded} is VALID [2022-02-21 03:24:37,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {634#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {634#unseeded} is VALID [2022-02-21 03:24:37,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {634#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {634#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {634#unseeded} is VALID [2022-02-21 03:24:37,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {634#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {634#unseeded} is VALID [2022-02-21 03:24:37,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {634#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {634#unseeded} is VALID [2022-02-21 03:24:37,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {634#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {634#unseeded} is VALID [2022-02-21 03:24:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,930 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:37,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:37,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {637#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {647#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~m~0#1|) (* (- 2) |ULTIMATE.start_main_~y~0#1|) 1))) unseeded)} is VALID [2022-02-21 03:24:37,934 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,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,937 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:37,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,937 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:37,938 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20 Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,955 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 45 transitions. cyclomatic complexity: 20. Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 46 states and 71 transitions. Complement of second has 5 states. [2022-02-21 03:24:37,956 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:37,956 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:37,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,957 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 71 transitions. [2022-02-21 03:24:37,957 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:24:37,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,958 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 45 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:37,958 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2022-02-21 03:24:37,958 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2022-02-21 03:24:37,959 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:37,959 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 46 states and 71 transitions. cyclomatic complexity: 32 [2022-02-21 03:24:37,959 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2022-02-21 03:24:37,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 6 letters. [2022-02-21 03:24:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:37,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 46 letters. Loop has 46 letters. [2022-02-21 03:24:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 46 letters. Loop has 46 letters. [2022-02-21 03:24:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 31 letters. Loop has 31 letters. [2022-02-21 03:24:37,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 5 letters. [2022-02-21 03:24:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:37,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 1 letters. [2022-02-21 03:24:37,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:37,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:24:37,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 6 letters. [2022-02-21 03:24:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 12 letters. Loop has 6 letters. [2022-02-21 03:24:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:37,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 15 letters. Loop has 3 letters. [2022-02-21 03:24:37,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:24:37,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:37,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 6 letters. [2022-02-21 03:24:37,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 6 letters. [2022-02-21 03:24:37,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:24:37,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 15 letters. Loop has 5 letters. [2022-02-21 03:24:37,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:24:37,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 45 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:24:37,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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 16 letters. Loop has 5 letters. [2022-02-21 03:24:37,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 46 states and 71 transitions. cyclomatic complexity: 32 Stem has 16 letters. Loop has 5 letters. [2022-02-21 03:24:37,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,972 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:37,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 23 transitions. [2022-02-21 03:24:37,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 1 letters. [2022-02-21 03:24:37,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 12 letters. Loop has 1 letters. [2022-02-21 03:24:37,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:24:37,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:37,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 71 transitions. cyclomatic complexity: 32 [2022-02-21 03:24:37,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2022-02-21 03:24:37,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 36 states and 51 transitions. [2022-02-21 03:24:37,976 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-02-21 03:24:37,976 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-02-21 03:24:37,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 51 transitions. [2022-02-21 03:24:37,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:37,976 INFO L681 BuchiCegarLoop]: Abstraction has 36 states and 51 transitions. [2022-02-21 03:24:37,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 51 transitions. [2022-02-21 03:24:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2022-02-21 03:24:37,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:37,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 51 transitions. Second operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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,978 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 51 transitions. Second operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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,978 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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,978 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:37,979 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-02-21 03:24:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2022-02-21 03:24:37,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:37,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:37,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 51 transitions. [2022-02-21 03:24:37,980 INFO L87 Difference]: Start difference. First operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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 51 transitions. [2022-02-21 03:24:37,980 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:37,982 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2022-02-21 03:24:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 52 transitions. [2022-02-21 03:24:37,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:37,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:37,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:37,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:37,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 28 states have internal predecessors, (42), 0 states have call successors, (0), 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,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2022-02-21 03:24:37,983 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-02-21 03:24:37,988 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 42 transitions. [2022-02-21 03:24:37,988 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:37,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. [2022-02-21 03:24:37,988 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:24:37,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:37,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:37,989 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-02-21 03:24:37,989 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-02-21 03:24:37,989 INFO L791 eck$LassoCheckResult]: Stem: 897#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 898#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 899#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 901#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 913#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 921#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 912#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 919#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 920#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 918#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 915#L20-2 [2022-02-21 03:24:37,989 INFO L793 eck$LassoCheckResult]: Loop: 915#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 908#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 893#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 894#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 917#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 914#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 915#L20-2 [2022-02-21 03:24:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1041382945, now seen corresponding path program 4 times [2022-02-21 03:24:37,990 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:37,990 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234361520] [2022-02-21 03:24:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {1067#true} assume { :begin_inline_ULTIMATE.init } true; {1067#true} is VALID [2022-02-21 03:24:38,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {1067#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:38,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:38,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:38,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:38,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~x~0#1 := main_~x~0#1 - 1; {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:38,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {1069#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {1070#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:38,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {1070#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1068#false} is VALID [2022-02-21 03:24:38,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#false} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1068#false} is VALID [2022-02-21 03:24:38,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {1068#false} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1068#false} is VALID [2022-02-21 03:24:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:38,026 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:38,026 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234361520] [2022-02-21 03:24:38,026 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234361520] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:38,026 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:38,026 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:24:38,027 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638383296] [2022-02-21 03:24:38,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:38,029 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:24:38,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1514585468, now seen corresponding path program 1 times [2022-02-21 03:24:38,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305801377] [2022-02-21 03:24:38,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,038 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,094 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:38,095 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:38,095 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:38,095 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:38,095 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:38,095 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,095 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:38,095 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:38,095 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2022-02-21 03:24:38,095 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:38,095 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:38,096 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,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:38,115 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,214 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:38,214 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:38,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,215 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:38,236 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,236 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,248 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:38,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:38,249 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:38,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,270 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:38,271 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:38,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,286 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:38,286 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:38,301 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:38,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,303 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:38,304 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:38,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:38,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,330 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:38,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,331 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:38,332 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:38,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:38,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:38,383 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:38,386 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:38,387 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:38,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:38,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:38,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:38,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:38,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:38,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:38,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2022-02-21 03:24:38,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:38,387 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:38,388 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,393 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,397 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,401 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,409 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,527 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:38,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:38,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,529 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:38,548 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,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,554 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,554 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,554 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,556 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:38,556 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:38,559 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:38,575 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:38,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,593 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:38,594 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:38,595 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,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:38,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:38,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:38,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,635 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:38,637 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:38,637 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,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:38,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:38,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:38,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:38,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:38,643 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:38,643 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:38,645 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:38,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:38,648 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:38,659 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:38,661 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:38,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:38,661 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:38,661 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:38,662 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:24:38,687 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:38,692 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:38,694 INFO L390 LassoCheck]: Loop: "assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;" "main_~x~0#1 := main_~x~0#1 - 1;" "main_~y~0#1 := main_~y~0#1 - 1;" "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1;" "assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1;" [2022-02-21 03:24:38,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:38,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {1073#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1073#unseeded} is VALID [2022-02-21 03:24:38,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {1073#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1073#unseeded} is VALID [2022-02-21 03:24:38,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {1073#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1073#unseeded} is VALID [2022-02-21 03:24:38,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {1073#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1073#unseeded} is VALID [2022-02-21 03:24:38,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {1073#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1073#unseeded} is VALID [2022-02-21 03:24:38,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {1073#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {1073#unseeded} is VALID [2022-02-21 03:24:38,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {1073#unseeded} is VALID [2022-02-21 03:24:38,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {1073#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1073#unseeded} is VALID [2022-02-21 03:24:38,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {1073#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1073#unseeded} is VALID [2022-02-21 03:24:38,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1073#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1073#unseeded} is VALID [2022-02-21 03:24:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:38,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:38,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:38,789 INFO L290 TraceCheckUtils]: 0: Hoare triple {1076#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1076#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:24:38,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1076#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} main_~x~0#1 := main_~x~0#1 - 1; {1121#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:38,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {1121#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0)} main_~y~0#1 := main_~y~0#1 - 1; {1121#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:38,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {1121#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1128#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:38,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {1128#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0))} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1128#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0))} is VALID [2022-02-21 03:24:38,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1128#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (<= (+ |ULTIMATE.start_main_~x~0#1| 1) oldRank0))} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1086#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:24:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:38,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:38,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:38,798 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 18 Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,824 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 42 transitions. cyclomatic complexity: 18. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 64 states and 98 transitions. Complement of second has 6 states. [2022-02-21 03:24:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:38,824 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:38,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 42 transitions. cyclomatic complexity: 18 [2022-02-21 03:24:38,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 98 transitions. [2022-02-21 03:24:38,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,827 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 42 transitions. cyclomatic complexity: 18 [2022-02-21 03:24:38,828 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:24:38,828 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,828 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:38,828 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 64 states and 98 transitions. cyclomatic complexity: 43 [2022-02-21 03:24:38,829 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:38,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 64 letters. Loop has 64 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:24:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:24:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 15 letters. Loop has 5 letters. [2022-02-21 03:24:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:24:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 11 letters. Loop has 5 letters. [2022-02-21 03:24:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:24:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:24:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 42 transitions. cyclomatic complexity: 18 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 64 states and 98 transitions. cyclomatic complexity: 43 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,851 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:38,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-02-21 03:24:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 6 letters. [2022-02-21 03:24:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:24:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 10 letters. Loop has 12 letters. [2022-02-21 03:24:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:38,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 98 transitions. cyclomatic complexity: 43 [2022-02-21 03:24:38,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 41 states and 59 transitions. [2022-02-21 03:24:38,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2022-02-21 03:24:38,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:24:38,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 59 transitions. [2022-02-21 03:24:38,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:38,854 INFO L681 BuchiCegarLoop]: Abstraction has 41 states and 59 transitions. [2022-02-21 03:24:38,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 59 transitions. [2022-02-21 03:24:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-02-21 03:24:38,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:38,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 59 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,856 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 59 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,856 INFO L87 Difference]: Start difference. First operand 41 states and 59 transitions. Second operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,856 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,857 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-02-21 03:24:38,859 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-02-21 03:24:38,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states and 59 transitions. [2022-02-21 03:24:38,859 INFO L87 Difference]: Start difference. First operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 41 states and 59 transitions. [2022-02-21 03:24:38,860 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,862 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-02-21 03:24:38,862 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2022-02-21 03:24:38,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:38,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.4) internal successors, (49), 34 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:38,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-02-21 03:24:38,864 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2022-02-21 03:24:38,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:38,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:24:38,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:24:38,867 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. 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:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:38,886 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions. [2022-02-21 03:24:38,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:24:38,886 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:38,892 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:38,893 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 39 transitions. [2022-02-21 03:24:38,893 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 24 states and 32 transitions. [2022-02-21 03:24:38,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:38,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:38,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2022-02-21 03:24:38,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:38,894 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-02-21 03:24:38,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2022-02-21 03:24:38,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-21 03:24:38,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:38,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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:38,895 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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:38,895 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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:38,896 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,896 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-02-21 03:24:38,896 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-02-21 03:24:38,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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 24 states and 32 transitions. [2022-02-21 03:24:38,897 INFO L87 Difference]: Start difference. First operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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 24 states and 32 transitions. [2022-02-21 03:24:38,897 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:38,898 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-02-21 03:24:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2022-02-21 03:24:38,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:38,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:38,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:38,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 23 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:38,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2022-02-21 03:24:38,899 INFO L704 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-02-21 03:24:38,899 INFO L587 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2022-02-21 03:24:38,899 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:24:38,899 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. [2022-02-21 03:24:38,899 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:38,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:38,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:38,899 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1, 1] [2022-02-21 03:24:38,899 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:38,900 INFO L791 eck$LassoCheckResult]: Stem: 1437#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1438#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 1448#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 1446#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 1441#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 1442#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1445#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 1435#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 1436#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 1440#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 1443#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 1444#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 1453#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 1452#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 1451#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 1449#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 1433#L19-2 [2022-02-21 03:24:38,900 INFO L793 eck$LassoCheckResult]: Loop: 1433#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 1434#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 1439#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 1433#L19-2 [2022-02-21 03:24:38,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash -410261761, now seen corresponding path program 1 times [2022-02-21 03:24:38,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959466517] [2022-02-21 03:24:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,926 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 59952, now seen corresponding path program 2 times [2022-02-21 03:24:38,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4374961] [2022-02-21 03:24:38,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:38,932 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:38,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:38,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1368832626, now seen corresponding path program 2 times [2022-02-21 03:24:38,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:38,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353219823] [2022-02-21 03:24:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:38,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#true} assume { :begin_inline_ULTIMATE.init } true; {1578#true} is VALID [2022-02-21 03:24:39,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,002 INFO L290 TraceCheckUtils]: 3: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,003 INFO L290 TraceCheckUtils]: 4: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:39,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1579#false} is VALID [2022-02-21 03:24:39,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {1579#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1579#false} is VALID [2022-02-21 03:24:39,008 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:24:39,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:39,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353219823] [2022-02-21 03:24:39,008 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353219823] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:39,008 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503214977] [2022-02-21 03:24:39,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-21 03:24:39,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:39,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,010 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:39,025 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:39,085 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-21 03:24:39,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:39,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-21 03:24:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:39,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:39,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#true} assume { :begin_inline_ULTIMATE.init } true; {1578#true} is VALID [2022-02-21 03:24:39,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:39,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1579#false} is VALID [2022-02-21 03:24:39,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {1579#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1579#false} is VALID [2022-02-21 03:24:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:24:39,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:39,268 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:39,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {1579#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1579#false} is VALID [2022-02-21 03:24:39,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1579#false} is VALID [2022-02-21 03:24:39,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {1582#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:39,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1581#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:39,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {1578#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1580#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:39,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {1578#true} assume { :begin_inline_ULTIMATE.init } true; {1578#true} is VALID [2022-02-21 03:24:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-21 03:24:39,338 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503214977] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:39,338 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:39,338 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-02-21 03:24:39,338 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139645141] [2022-02-21 03:24:39,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:39,369 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:39,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:39,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:39,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:39,370 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:39,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:39,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:39,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2022-02-21 03:24:39,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:39,371 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:39,371 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,374 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,376 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,378 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,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:39,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:39,459 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:39,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,460 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:39,462 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:39,463 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,481 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:39,481 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:39,502 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:39,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,507 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:39,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,553 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:39,564 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:39,564 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:39,590 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:39,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,592 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:39,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,594 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,596 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:39,615 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:39,616 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:39,639 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:39,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,642 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:39,643 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:39,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,665 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:39,666 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:39,687 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:39,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,689 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:39,691 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:39,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:39,692 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:39,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,734 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:39,736 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:39,737 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:39,737 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:39,800 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:39,805 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:39,805 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:39,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:39,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:39,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:39,805 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:39,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:39,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:39,805 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2022-02-21 03:24:39,805 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:39,805 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:39,806 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,820 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,824 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,826 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,829 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,899 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:39,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,900 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:39,916 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,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:39,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:39,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:39,926 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:39,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:39,950 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:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,952 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:39,953 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:39,954 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,959 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,960 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,961 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:39,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:39,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:39,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:39,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:39,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:39,981 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:39,982 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:39,983 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,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:39,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:39,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:39,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:39,990 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:39,990 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:40,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,023 INFO L229 MonitoredProcess]: Starting monitored process 48 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,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-02-21 03:24:40,027 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,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,033 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:40,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:40,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:40,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:40,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,070 INFO L229 MonitoredProcess]: Starting monitored process 49 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,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-02-21 03:24:40,072 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,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:40,078 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:40,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:40,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:40,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:40,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:40,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:40,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:40,098 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:40,099 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:40,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,101 INFO L229 MonitoredProcess]: Starting monitored process 50 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,103 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:40,103 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:40,103 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:40,103 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:24:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-02-21 03:24:40,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-02-21 03:24:40,132 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:40,136 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2022-02-21 03:24:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {1691#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1691#unseeded} is VALID [2022-02-21 03:24:40,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {1691#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1691#unseeded} is VALID [2022-02-21 03:24:40,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {1691#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {1691#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {1691#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {1691#unseeded} is VALID [2022-02-21 03:24:40,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {1691#unseeded} is VALID [2022-02-21 03:24:40,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1691#unseeded} is VALID [2022-02-21 03:24:40,207 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {1691#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {1691#unseeded} is VALID [2022-02-21 03:24:40,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {1691#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {1691#unseeded} is VALID [2022-02-21 03:24:40,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {1691#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1691#unseeded} is VALID [2022-02-21 03:24:40,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {1691#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1691#unseeded} is VALID [2022-02-21 03:24:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,214 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {1694#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {1754#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:40,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {1754#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {1758#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:40,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {1758#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {1704#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:40,261 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,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:40,269 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 12 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,304 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 32 transitions. cyclomatic complexity: 12. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 65 states and 88 transitions. Complement of second has 7 states. [2022-02-21 03:24:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:40,304 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,304 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 32 transitions. cyclomatic complexity: 12 [2022-02-21 03:24:40,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,305 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 88 transitions. [2022-02-21 03:24:40,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 32 transitions. cyclomatic complexity: 12 [2022-02-21 03:24:40,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:40,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,308 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,308 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:40,308 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 65 states and 88 transitions. cyclomatic complexity: 31 [2022-02-21 03:24:40,308 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:40,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:40,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:40,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 65 letters. Loop has 65 letters. [2022-02-21 03:24:40,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:24:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:40,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:40,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:40,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:24:40,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:40,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:40,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:24:40,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:40,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:40,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:40,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:40,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 32 transitions. cyclomatic complexity: 12 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:40,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:40,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 65 states and 88 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:40,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,318 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:24:40,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:24:40,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:24:40,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:24:40,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:40,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 88 transitions. cyclomatic complexity: 31 [2022-02-21 03:24:40,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 46 states and 62 transitions. [2022-02-21 03:24:40,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:40,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:40,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2022-02-21 03:24:40,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,323 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-02-21 03:24:40,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2022-02-21 03:24:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2022-02-21 03:24:40,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 62 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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,326 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 62 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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,326 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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,326 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,328 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-21 03:24:40,328 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-21 03:24:40,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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 46 states and 62 transitions. [2022-02-21 03:24:40,329 INFO L87 Difference]: Start difference. First operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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 46 states and 62 transitions. [2022-02-21 03:24:40,329 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,330 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-21 03:24:40,330 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-21 03:24:40,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 34 states have internal predecessors, (47), 0 states have call successors, (0), 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,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-02-21 03:24:40,332 INFO L704 BuchiCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-02-21 03:24:40,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:40,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:24:40,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:24:40,333 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:40,373 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-02-21 03:24:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:24:40,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:40,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2022-02-21 03:24:40,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 46 states and 59 transitions. [2022-02-21 03:24:40,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:40,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:40,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 59 transitions. [2022-02-21 03:24:40,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:40,388 INFO L681 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-02-21 03:24:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 59 transitions. [2022-02-21 03:24:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 41. [2022-02-21 03:24:40,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:40,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 59 transitions. Second operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,390 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 59 transitions. Second operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,390 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,391 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,392 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-02-21 03:24:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-02-21 03:24:40,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states and 59 transitions. [2022-02-21 03:24:40,393 INFO L87 Difference]: Start difference. First operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states and 59 transitions. [2022-02-21 03:24:40,393 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:40,394 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-02-21 03:24:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-02-21 03:24:40,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:40,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:40,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:40,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 40 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2022-02-21 03:24:40,396 INFO L704 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-21 03:24:40,396 INFO L587 BuchiCegarLoop]: Abstraction has 41 states and 54 transitions. [2022-02-21 03:24:40,396 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:24:40,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. [2022-02-21 03:24:40,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:40,397 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,397 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1, 1] [2022-02-21 03:24:40,397 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:40,398 INFO L791 eck$LassoCheckResult]: Stem: 2123#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2124#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 2135#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 2132#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 2127#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 2128#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 2155#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2131#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 2121#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 2122#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 2126#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 2145#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 2148#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 2144#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 2142#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 2138#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 2141#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 2140#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 2139#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 2136#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 2119#L19-2 [2022-02-21 03:24:40,398 INFO L793 eck$LassoCheckResult]: Loop: 2119#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 2120#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 2125#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 2119#L19-2 [2022-02-21 03:24:40,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,398 INFO L85 PathProgramCache]: Analyzing trace with hash 33262129, now seen corresponding path program 3 times [2022-02-21 03:24:40,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,399 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524472673] [2022-02-21 03:24:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,422 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,429 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,429 INFO L85 PathProgramCache]: Analyzing trace with hash 59952, now seen corresponding path program 3 times [2022-02-21 03:24:40,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2482187] [2022-02-21 03:24:40,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,456 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1225330176, now seen corresponding path program 4 times [2022-02-21 03:24:40,458 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262516279] [2022-02-21 03:24:40,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {2376#true} assume { :begin_inline_ULTIMATE.init } true; {2376#true} is VALID [2022-02-21 03:24:40,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {2376#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~x~0#1 := main_~x~0#1 - 1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~y~0#1 := main_~y~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,536 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,541 INFO L290 TraceCheckUtils]: 18: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,542 INFO L290 TraceCheckUtils]: 20: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:40,542 INFO L290 TraceCheckUtils]: 21: Hoare triple {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2377#false} is VALID [2022-02-21 03:24:40,542 INFO L290 TraceCheckUtils]: 22: Hoare triple {2377#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2377#false} is VALID [2022-02-21 03:24:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:24:40,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:40,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262516279] [2022-02-21 03:24:40,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262516279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:24:40,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767450426] [2022-02-21 03:24:40,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:24:40,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:24:40,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,545 INFO L229 MonitoredProcess]: Starting monitored process 51 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:40,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-02-21 03:24:40,577 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:24:40,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:24:40,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-21 03:24:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:40,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {2376#true} assume { :begin_inline_ULTIMATE.init } true; {2376#true} is VALID [2022-02-21 03:24:40,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {2376#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~x~0#1 := main_~x~0#1 - 1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~y~0#1 := main_~y~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,727 INFO L290 TraceCheckUtils]: 14: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,728 INFO L290 TraceCheckUtils]: 17: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:40,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2377#false} is VALID [2022-02-21 03:24:40,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {2377#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2377#false} is VALID [2022-02-21 03:24:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:24:40,731 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:24:40,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {2377#false} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2377#false} is VALID [2022-02-21 03:24:40,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2377#false} is VALID [2022-02-21 03:24:40,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} main_~y~0#1 := main_~y~0#1 - 1; {2381#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) 0)} is VALID [2022-02-21 03:24:40,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,857 INFO L290 TraceCheckUtils]: 16: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} main_~y~0#1 := main_~y~0#1 - 1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,860 INFO L290 TraceCheckUtils]: 10: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~y~0#1 := main_~y~0#1 - 1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} main_~x~0#1 := main_~x~0#1 - 1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,861 INFO L290 TraceCheckUtils]: 6: Hoare triple {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2380#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:24:40,862 INFO L290 TraceCheckUtils]: 4: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2379#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:24:40,863 INFO L290 TraceCheckUtils]: 3: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {2376#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {2378#(<= |ULTIMATE.start_main_~y~0#1| 0)} is VALID [2022-02-21 03:24:40,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {2376#true} assume { :begin_inline_ULTIMATE.init } true; {2376#true} is VALID [2022-02-21 03:24:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:24:40,864 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767450426] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:24:40,864 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:24:40,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2022-02-21 03:24:40,865 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248001783] [2022-02-21 03:24:40,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:24:40,884 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:40,885 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:40,885 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:40,885 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:40,885 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:40,885 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,885 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,885 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,886 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2022-02-21 03:24:40,886 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,886 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,886 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,889 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,891 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,895 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,898 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,958 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,958 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,960 INFO L229 MonitoredProcess]: Starting monitored process 52 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,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-02-21 03:24:40,990 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,990 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:41,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,014 INFO L229 MonitoredProcess]: Starting monitored process 53 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,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-02-21 03:24:41,017 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,017 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,033 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,033 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:41,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,059 INFO L229 MonitoredProcess]: Starting monitored process 54 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,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-02-21 03:24:41,061 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Ended with exit code 0 [2022-02-21 03:24:41,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,094 INFO L229 MonitoredProcess]: Starting monitored process 55 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,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-02-21 03:24:41,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:41,096 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,166 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:41,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,171 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,172 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:41,172 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2022-02-21 03:24:41,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,172 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,173 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,176 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,180 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,182 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,185 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,244 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,245 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,260 INFO L229 MonitoredProcess]: Starting monitored process 56 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,265 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,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,274 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-02-21 03:24:41,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,301 INFO L229 MonitoredProcess]: Starting monitored process 57 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,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-02-21 03:24:41,303 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:41,311 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,311 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,311 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,312 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,314 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:41,315 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:41,315 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:41,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,317 INFO L229 MonitoredProcess]: Starting monitored process 58 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,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-02-21 03:24:41,318 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:41,319 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:41,319 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:41,319 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:24:41,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,345 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:41,348 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2022-02-21 03:24:41,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {2514#unseeded} assume { :begin_inline_ULTIMATE.init } true; {2514#unseeded} is VALID [2022-02-21 03:24:41,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {2514#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,414 INFO L290 TraceCheckUtils]: 3: Hoare triple {2514#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {2514#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {2514#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,415 INFO L290 TraceCheckUtils]: 9: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {2514#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {2514#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,417 INFO L290 TraceCheckUtils]: 14: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {2514#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {2514#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {2514#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,422 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {2517#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {2589#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:41,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {2589#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2593#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:41,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {2593#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2527#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:41,457 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,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,462 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,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:41,463 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,491 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 47 states and 62 transitions. Complement of second has 7 states. [2022-02-21 03:24:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:41,491 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:41,491 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,492 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 62 transitions. [2022-02-21 03:24:41,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,493 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,493 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:41,494 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:41,494 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,494 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:41,494 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 62 transitions. cyclomatic complexity: 22 [2022-02-21 03:24:41,495 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:41,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:24:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 47 letters. Loop has 47 letters. [2022-02-21 03:24:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 47 letters. Loop has 47 letters. [2022-02-21 03:24:41,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:41,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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:41,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:41,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 62 transitions. cyclomatic complexity: 22 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,504 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:24:41,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,521 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {2514#unseeded} assume { :begin_inline_ULTIMATE.init } true; {2514#unseeded} is VALID [2022-02-21 03:24:41,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {2514#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,594 INFO L290 TraceCheckUtils]: 3: Hoare triple {2514#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,594 INFO L290 TraceCheckUtils]: 4: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {2514#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {2514#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {2514#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {2514#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {2514#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {2514#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {2514#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {2514#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {2514#unseeded} is VALID [2022-02-21 03:24:41,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {2514#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2514#unseeded} is VALID [2022-02-21 03:24:41,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {2514#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2514#unseeded} is VALID [2022-02-21 03:24:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,602 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {2517#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {2715#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:41,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {2719#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:41,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {2719#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {2527#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:41,632 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,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,637 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,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:41,638 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 20 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,671 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 54 transitions. cyclomatic complexity: 20. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 75 states and 98 transitions. Complement of second has 9 states. [2022-02-21 03:24:41,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:41,672 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:41,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:41,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 98 transitions. [2022-02-21 03:24:41,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,673 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 54 transitions. cyclomatic complexity: 20 [2022-02-21 03:24:41,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:41,674 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,674 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:41,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:41,674 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 75 states and 98 transitions. cyclomatic complexity: 34 [2022-02-21 03:24:41,674 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 3 letters. [2022-02-21 03:24:41,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 75 letters. Loop has 75 letters. [2022-02-21 03:24:41,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 75 letters. Loop has 75 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 75 letters. Loop has 75 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 41 letters. Loop has 41 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:41,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 5 letters. Loop has 5 letters. [2022-02-21 03:24:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 3 letters. [2022-02-21 03:24:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:41,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:41,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:41,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:41,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 54 transitions. cyclomatic complexity: 20 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 75 states and 98 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:24:41,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,682 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:24:41,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:24:41,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:41,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 20 letters. Loop has 6 letters. [2022-02-21 03:24:41,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,683 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 98 transitions. cyclomatic complexity: 34 [2022-02-21 03:24:41,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 69 states and 90 transitions. [2022-02-21 03:24:41,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:41,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:41,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 90 transitions. [2022-02-21 03:24:41,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:41,686 INFO L681 BuchiCegarLoop]: Abstraction has 69 states and 90 transitions. [2022-02-21 03:24:41,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 90 transitions. [2022-02-21 03:24:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2022-02-21 03:24:41,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:41,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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,689 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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,689 INFO L87 Difference]: Start difference. First operand 69 states and 90 transitions. Second operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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,689 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,690 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-21 03:24:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-21 03:24:41,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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 69 states and 90 transitions. [2022-02-21 03:24:41,691 INFO L87 Difference]: Start difference. First operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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 69 states and 90 transitions. [2022-02-21 03:24:41,691 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,692 INFO L93 Difference]: Finished difference Result 69 states and 90 transitions. [2022-02-21 03:24:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 90 transitions. [2022-02-21 03:24:41,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:41,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.3278688524590163) internal successors, (81), 60 states have internal predecessors, (81), 0 states have call successors, (0), 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,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-02-21 03:24:41,693 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-02-21 03:24:41,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:24:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:24:41,694 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:41,727 INFO L93 Difference]: Finished difference Result 150 states and 189 transitions. [2022-02-21 03:24:41,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:24:41,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:41,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:41,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 189 transitions. [2022-02-21 03:24:41,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 108 states and 138 transitions. [2022-02-21 03:24:41,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:41,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:41,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 138 transitions. [2022-02-21 03:24:41,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:41,744 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 138 transitions. [2022-02-21 03:24:41,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 138 transitions. [2022-02-21 03:24:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 84. [2022-02-21 03:24:41,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:41,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states and 138 transitions. Second operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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,747 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states and 138 transitions. Second operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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,747 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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,747 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,749 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-02-21 03:24:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-02-21 03:24:41,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,749 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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 108 states and 138 transitions. [2022-02-21 03:24:41,749 INFO L87 Difference]: Start difference. First operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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 108 states and 138 transitions. [2022-02-21 03:24:41,750 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,751 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-02-21 03:24:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2022-02-21 03:24:41,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:41,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3333333333333333) internal successors, (112), 83 states have internal predecessors, (112), 0 states have call successors, (0), 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,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2022-02-21 03:24:41,753 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 112 transitions. [2022-02-21 03:24:41,753 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 112 transitions. [2022-02-21 03:24:41,753 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:24:41,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 112 transitions. [2022-02-21 03:24:41,753 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:41,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,754 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1] [2022-02-21 03:24:41,754 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:24:41,754 INFO L791 eck$LassoCheckResult]: Stem: 3298#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3299#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; 3300#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 3301#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 3309#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 3303#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 3305#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 3347#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 3348#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 3343#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 3344#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 3335#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 3334#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 3329#L19 assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; 3326#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 3323#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 3325#L20-2 assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; 3315#L20-2 assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; 3318#L20-3 main_~x~0#1 := main_~x~0#1 - 1; 3317#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 3316#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 3313#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 3294#L19-2 [2022-02-21 03:24:41,754 INFO L793 eck$LassoCheckResult]: Loop: 3294#L19-2 main_~y~0#1 := main_~y~0#1 - 1; 3295#L18-2 assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); 3312#L19 assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; 3294#L19-2 [2022-02-21 03:24:41,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,754 INFO L85 PathProgramCache]: Analyzing trace with hash -743097903, now seen corresponding path program 5 times [2022-02-21 03:24:41,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792907761] [2022-02-21 03:24:41,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,764 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,771 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,771 INFO L85 PathProgramCache]: Analyzing trace with hash 59952, now seen corresponding path program 4 times [2022-02-21 03:24:41,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,772 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726723116] [2022-02-21 03:24:41,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,776 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1368154528, now seen corresponding path program 6 times [2022-02-21 03:24:41,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636825368] [2022-02-21 03:24:41,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,785 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,791 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,807 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,807 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,807 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,807 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:41,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2022-02-21 03:24:41,808 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,808 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,808 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,810 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,812 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,814 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,816 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,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,869 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:41,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,870 INFO L229 MonitoredProcess]: Starting monitored process 59 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,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-02-21 03:24:41,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,886 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,886 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:41,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,909 INFO L229 MonitoredProcess]: Starting monitored process 60 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,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-02-21 03:24:41,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,927 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,928 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=0} Honda state: {ULTIMATE.start_main_~x~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:41,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,948 INFO L229 MonitoredProcess]: Starting monitored process 61 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,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-02-21 03:24:41,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,951 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,962 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,963 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:41,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,988 INFO L229 MonitoredProcess]: Starting monitored process 62 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,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-02-21 03:24:41,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,991 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,999 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,999 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,023 INFO L229 MonitoredProcess]: Starting monitored process 63 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,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-02-21 03:24:42,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,026 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-02-21 03:24:42,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,071 INFO L229 MonitoredProcess]: Starting monitored process 64 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,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-02-21 03:24:42,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,147 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:42,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,152 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,152 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,152 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:42,152 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,152 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,152 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,152 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2022-02-21 03:24:42,152 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,152 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,153 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,158 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,160 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,163 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,166 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,224 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,224 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:42,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,232 INFO L229 MonitoredProcess]: Starting monitored process 65 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,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-02-21 03:24:42,235 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:42,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,242 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,264 INFO L229 MonitoredProcess]: Starting monitored process 66 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,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-02-21 03:24:42,267 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:42,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,273 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,273 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,307 INFO L229 MonitoredProcess]: Starting monitored process 67 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,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-02-21 03:24:42,309 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:42,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,317 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-02-21 03:24:42,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,338 INFO L229 MonitoredProcess]: Starting monitored process 68 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,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-02-21 03:24:42,340 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:42,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,347 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,347 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,347 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,347 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,351 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:42,351 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:42,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,352 INFO L229 MonitoredProcess]: Starting monitored process 69 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,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-02-21 03:24:42,354 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,355 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,355 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,355 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:24:42,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-02-21 03:24:42,376 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,379 INFO L390 LassoCheck]: Loop: "main_~y~0#1 := main_~y~0#1 - 1;" "assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0);" "assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1;" [2022-02-21 03:24:42,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,446 INFO L290 TraceCheckUtils]: 0: Hoare triple {3807#unseeded} assume { :begin_inline_ULTIMATE.init } true; {3807#unseeded} is VALID [2022-02-21 03:24:42,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,447 INFO L290 TraceCheckUtils]: 3: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,448 INFO L290 TraceCheckUtils]: 4: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,450 INFO L290 TraceCheckUtils]: 9: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,450 INFO L290 TraceCheckUtils]: 10: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,450 INFO L290 TraceCheckUtils]: 11: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,451 INFO L290 TraceCheckUtils]: 12: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,453 INFO L290 TraceCheckUtils]: 18: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,453 INFO L290 TraceCheckUtils]: 19: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,454 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,454 INFO L290 TraceCheckUtils]: 21: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,458 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {3810#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {3888#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:42,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {3888#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3892#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:42,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {3892#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3820#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:42,496 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,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,501 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,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,501 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:42,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,559 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 102 states and 135 transitions. Complement of second has 7 states. [2022-02-21 03:24:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,559 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 135 transitions. [2022-02-21 03:24:42,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,561 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,561 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,561 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 102 states and 135 transitions. cyclomatic complexity: 44 [2022-02-21 03:24:42,563 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 102 letters. Loop has 102 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 102 letters. Loop has 102 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 102 states and 135 transitions. cyclomatic complexity: 44 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,570 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-02-21 03:24:42,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,571 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {3807#unseeded} assume { :begin_inline_ULTIMATE.init } true; {3807#unseeded} is VALID [2022-02-21 03:24:42,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,621 INFO L290 TraceCheckUtils]: 8: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,624 INFO L290 TraceCheckUtils]: 19: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,628 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {3810#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {4075#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:42,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4075#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {4079#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:42,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {4079#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3820#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:42,658 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,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,663 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,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,663 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:24:42,664 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,698 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 129 states and 167 transitions. Complement of second has 9 states. [2022-02-21 03:24:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,698 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,699 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:42,699 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,699 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 167 transitions. [2022-02-21 03:24:42,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,700 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,700 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:42,701 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,701 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 129 states and 167 transitions. cyclomatic complexity: 55 [2022-02-21 03:24:42,701 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 3 letters. [2022-02-21 03:24:42,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:24:42,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 129 letters. Loop has 129 letters. [2022-02-21 03:24:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 129 letters. Loop has 129 letters. [2022-02-21 03:24:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 3 letters. [2022-02-21 03:24:42,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:24:42,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 129 states and 167 transitions. cyclomatic complexity: 55 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,710 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-21 03:24:42,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,711 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {3807#unseeded} assume { :begin_inline_ULTIMATE.init } true; {3807#unseeded} is VALID [2022-02-21 03:24:42,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3807#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_~x~0#1, main_~y~0#1, main_~m~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~m~0#1;main_~y~0#1 := 0;main_~m~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~x~0#1 := main_~m~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,763 INFO L290 TraceCheckUtils]: 11: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {3807#unseeded} assume 0 != main_#t~nondet1#1;havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,764 INFO L290 TraceCheckUtils]: 15: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {3807#unseeded} assume !!(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := 1 + main_~y~0#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {3807#unseeded} assume !(main_~y~0#1 <= main_~m~0#1 && 0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,765 INFO L290 TraceCheckUtils]: 18: Hoare triple {3807#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,766 INFO L290 TraceCheckUtils]: 19: Hoare triple {3807#unseeded} main_~y~0#1 := main_~y~0#1 - 1; {3807#unseeded} is VALID [2022-02-21 03:24:42,766 INFO L290 TraceCheckUtils]: 20: Hoare triple {3807#unseeded} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {3807#unseeded} is VALID [2022-02-21 03:24:42,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {3807#unseeded} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3807#unseeded} is VALID [2022-02-21 03:24:42,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,769 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {3810#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} main_~y~0#1 := main_~y~0#1 - 1; {4292#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} is VALID [2022-02-21 03:24:42,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {4292#(<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0)} assume !!(main_~x~0#1 >= 0 && main_~y~0#1 >= 0); {4296#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:24:42,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {4296#(and (<= (+ |ULTIMATE.start_main_~y~0#1| 1) oldRank0) (<= 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet1#1);havoc main_#t~nondet1#1; {3820#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:24:42,801 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,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,805 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,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,806 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 3 loop predicates [2022-02-21 03:24:42,806 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 112 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 140 states and 188 transitions. Complement of second has 8 states. [2022-02-21 03:24:42,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,831 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,831 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,831 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,831 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 188 transitions. [2022-02-21 03:24:42,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,832 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 84 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:24:42,832 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:24:42,832 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:24:42,833 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,833 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 140 states and 188 transitions. cyclomatic complexity: 60 [2022-02-21 03:24:42,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 188 transitions. cyclomatic complexity: 60 [2022-02-21 03:24:42,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,833 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:42,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 140 letters. Loop has 140 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 140 letters. Loop has 140 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 140 letters. Loop has 140 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 84 letters. Loop has 84 letters. [2022-02-21 03:24:42,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:42,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:24:42,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:24:42,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 84 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 140 states and 188 transitions. cyclomatic complexity: 60 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,838 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2022-02-21 03:24:42,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:24:42,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:24:42,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 22 letters. Loop has 6 letters. [2022-02-21 03:24:42,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,840 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 188 transitions. cyclomatic complexity: 60 [2022-02-21 03:24:42,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:42,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:42,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:42,842 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:24:42,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:42,842 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:42,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:42,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:42 BoogieIcfgContainer [2022-02-21 03:24:42,847 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:42,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:42,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:42,848 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:42,848 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:34" (3/4) ... [2022-02-21 03:24:42,850 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:42,850 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:42,851 INFO L158 Benchmark]: Toolchain (without parser) took 9304.13ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 64.5MB in the beginning and 71.0MB in the end (delta: -6.5MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,851 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,851 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.11ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 74.1MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.82ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 72.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,852 INFO L158 Benchmark]: Boogie Preprocessor took 14.90ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,852 INFO L158 Benchmark]: RCFGBuilder took 227.00ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 63.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,852 INFO L158 Benchmark]: BuchiAutomizer took 8838.95ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 63.0MB in the beginning and 71.0MB in the end (delta: -8.0MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. [2022-02-21 03:24:42,852 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:42,853 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 96.5MB. Free memory was 52.0MB in the beginning and 51.9MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.11ms. Allocated memory is still 96.5MB. Free memory was 64.3MB in the beginning and 74.1MB in the end (delta: -9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.82ms. Allocated memory is still 96.5MB. Free memory was 74.1MB in the beginning and 72.8MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.90ms. Allocated memory is still 96.5MB. Free memory was 72.8MB in the beginning and 71.7MB in the end (delta: 1.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 227.00ms. Allocated memory is still 96.5MB. Free memory was 71.7MB in the beginning and 63.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8838.95ms. Allocated memory was 96.5MB in the beginning and 142.6MB in the end (delta: 46.1MB). Free memory was 63.0MB in the beginning and 71.0MB in the end (delta: -8.0MB). Peak memory consumption was 39.5MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 142.6MB. Free memory is still 71.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (3 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.8s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 65 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 192 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 192 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 162 IncrementalHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 164 mSDtfsCounter, 162 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax167 hnf100 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf94 smp100 dnf113 smp95 tf111 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:42,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE