./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.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-speedpldi3.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 59f8de3095dec84b471ea17a2f8054509a628ca6c3fce9f023768548ca2b0891
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-03d7b7b
[2022-02-21 03:24:38,811 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2022-02-21 03:24:38,813 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2022-02-21 03:24:38,855 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2022-02-21 03:24:38,856 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2022-02-21 03:24:38,859 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2022-02-21 03:24:38,860 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2022-02-21 03:24:38,863 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2022-02-21 03:24:38,864 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2022-02-21 03:24:38,868 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2022-02-21 03:24:38,869 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2022-02-21 03:24:38,870 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2022-02-21 03:24:38,870 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2022-02-21 03:24:38,872 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2022-02-21 03:24:38,873 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2022-02-21 03:24:38,874 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2022-02-21 03:24:38,875 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2022-02-21 03:24:38,875 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2022-02-21 03:24:38,876 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2022-02-21 03:24:38,877 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2022-02-21 03:24:38,879 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2022-02-21 03:24:38,879 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2022-02-21 03:24:38,883 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2022-02-21 03:24:38,884 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2022-02-21 03:24:38,889 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2022-02-21 03:24:38,892 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2022-02-21 03:24:38,892 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2022-02-21 03:24:38,893 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2022-02-21 03:24:38,894 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2022-02-21 03:24:38,895 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2022-02-21 03:24:38,896 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2022-02-21 03:24:38,896 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2022-02-21 03:24:38,898 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2022-02-21 03:24:38,899 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2022-02-21 03:24:38,900 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2022-02-21 03:24:38,901 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2022-02-21 03:24:38,901 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2022-02-21 03:24:38,902 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2022-02-21 03:24:38,902 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2022-02-21 03:24:38,903 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2022-02-21 03:24:38,903 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2022-02-21 03:24:38,904 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:38,933 INFO  L113        SettingsManager]: Loading preferences was successful
[2022-02-21 03:24:38,934 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2022-02-21 03:24:38,934 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2022-02-21 03:24:38,934 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2022-02-21 03:24:38,936 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2022-02-21 03:24:38,936 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2022-02-21 03:24:38,936 INFO  L138        SettingsManager]:  * Use SBE=true
[2022-02-21 03:24:38,936 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2022-02-21 03:24:38,936 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2022-02-21 03:24:38,937 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2022-02-21 03:24:38,937 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2022-02-21 03:24:38,938 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2022-02-21 03:24:38,938 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2022-02-21 03:24:38,938 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2022-02-21 03:24:38,938 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2022-02-21 03:24:38,938 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2022-02-21 03:24:38,938 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2022-02-21 03:24:38,939 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2022-02-21 03:24:38,940 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2022-02-21 03:24:38,940 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2022-02-21 03:24:38,940 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2022-02-21 03:24:38,940 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2022-02-21 03:24:38,940 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2022-02-21 03:24:38,941 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2022-02-21 03:24:38,941 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 -> 59f8de3095dec84b471ea17a2f8054509a628ca6c3fce9f023768548ca2b0891
[2022-02-21 03:24:39,150 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2022-02-21 03:24:39,177 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2022-02-21 03:24:39,179 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2022-02-21 03:24:39,181 INFO  L271        PluginConnector]: Initializing CDTParser...
[2022-02-21 03:24:39,182 INFO  L275        PluginConnector]: CDTParser initialized
[2022-02-21 03:24:39,183 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c
[2022-02-21 03:24:39,248 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657bf89a6/0b32f56c9d2245458c7c7b0e3d39aca6/FLAG3ed9f4f2a
[2022-02-21 03:24:39,615 INFO  L306              CDTParser]: Found 1 translation units.
[2022-02-21 03:24:39,615 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c
[2022-02-21 03:24:39,621 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657bf89a6/0b32f56c9d2245458c7c7b0e3d39aca6/FLAG3ed9f4f2a
[2022-02-21 03:24:40,039 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/657bf89a6/0b32f56c9d2245458c7c7b0e3d39aca6
[2022-02-21 03:24:40,041 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2022-02-21 03:24:40,042 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2022-02-21 03:24:40,043 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2022-02-21 03:24:40,043 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2022-02-21 03:24:40,046 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2022-02-21 03:24:40,047 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:40" (1/1) ...
[2022-02-21 03:24:40,048 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cb8cedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:40, skipping insertion in model container
[2022-02-21 03:24:40,048 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:40" (1/1) ...
[2022-02-21 03:24:40,054 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2022-02-21 03:24:40,064 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2022-02-21 03:24:40,195 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-21 03:24:40,198 INFO  L203         MainTranslator]: Completed pre-run
[2022-02-21 03:24:40,209 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2022-02-21 03:24:40,231 INFO  L208         MainTranslator]: Completed translation
[2022-02-21 03:24:40,232 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:40 WrapperNode
[2022-02-21 03:24:40,232 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2022-02-21 03:24:40,233 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2022-02-21 03:24:40,233 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2022-02-21 03:24:40,233 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2022-02-21 03:24:40,241 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:40" (1/1) ...
[2022-02-21 03:24:40,244 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:40" (1/1) ...
[2022-02-21 03:24:40,260 INFO  L137                Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23
[2022-02-21 03:24:40,261 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2022-02-21 03:24:40,261 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2022-02-21 03:24:40,261 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2022-02-21 03:24:40,262 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2022-02-21 03:24:40,268 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:40" (1/1) ...
[2022-02-21 03:24:40,268 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:40" (1/1) ...
[2022-02-21 03:24:40,269 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:40" (1/1) ...
[2022-02-21 03:24:40,269 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:40" (1/1) ...
[2022-02-21 03:24:40,271 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:40" (1/1) ...
[2022-02-21 03:24:40,277 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:40" (1/1) ...
[2022-02-21 03:24:40,277 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:40" (1/1) ...
[2022-02-21 03:24:40,278 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2022-02-21 03:24:40,279 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2022-02-21 03:24:40,280 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2022-02-21 03:24:40,280 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2022-02-21 03:24:40,281 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:40" (1/1) ...
[2022-02-21 03:24:40,288 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:40,297 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:40,313 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:40,319 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:40,354 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2022-02-21 03:24:40,355 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2022-02-21 03:24:40,396 INFO  L234             CfgBuilder]: Building ICFG
[2022-02-21 03:24:40,397 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2022-02-21 03:24:40,469 INFO  L275             CfgBuilder]: Performing block encoding
[2022-02-21 03:24:40,477 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2022-02-21 03:24:40,477 INFO  L299             CfgBuilder]: Removed 1 assume(true) statements.
[2022-02-21 03:24:40,478 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:40 BoogieIcfgContainer
[2022-02-21 03:24:40,479 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2022-02-21 03:24:40,479 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2022-02-21 03:24:40,482 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2022-02-21 03:24:40,484 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2022-02-21 03:24:40,485 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-02-21 03:24:40,485 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:40" (1/3) ...
[2022-02-21 03:24:40,486 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38205b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:40, skipping insertion in model container
[2022-02-21 03:24:40,486 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-02-21 03:24:40,487 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:40" (2/3) ...
[2022-02-21 03:24:40,487 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38205b71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:40, skipping insertion in model container
[2022-02-21 03:24:40,487 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2022-02-21 03:24:40,487 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:40" (3/3) ...
[2022-02-21 03:24:40,489 INFO  L388   chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c
[2022-02-21 03:24:40,529 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2022-02-21 03:24:40,530 INFO  L360         BuchiCegarLoop]: Hoare is false
[2022-02-21 03:24:40,530 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2022-02-21 03:24:40,530 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2022-02-21 03:24:40,530 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2022-02-21 03:24:40,530 INFO  L364         BuchiCegarLoop]: Difference is false
[2022-02-21 03:24:40,530 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2022-02-21 03:24:40,530 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2022-02-21 03:24:40,547 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:40,578 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:40,578 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:40,578 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:40,583 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2022-02-21 03:24:40,583 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2022-02-21 03:24:40,583 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2022-02-21 03:24:40,584 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:40,589 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:40,589 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:40,589 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:40,590 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2022-02-21 03:24:40,590 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2022-02-21 03:24:40,597 INFO  L791   eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 4#L17true assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; 8#L21-2true 
[2022-02-21 03:24:40,598 INFO  L793   eck$LassoCheckResult]: Loop: 8#L21-2true assume !!(main_~i~0#1 < main_~n~0#1); 6#L21true assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; 8#L21-2true 
[2022-02-21 03:24:40,604 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:40,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times
[2022-02-21 03:24:40,614 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:40,614 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904205521]
[2022-02-21 03:24:40,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:40,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:40,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,703 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:40,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,732 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:40,736 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:40,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 1 times
[2022-02-21 03:24:40,736 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:40,737 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347462011]
[2022-02-21 03:24:40,737 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:40,737 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:40,756 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,757 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:40,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,770 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:40,772 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:40,772 INFO  L85        PathProgramCache]: Analyzing trace with hash 28693989, now seen corresponding path program 1 times
[2022-02-21 03:24:40,772 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:40,772 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158771475]
[2022-02-21 03:24:40,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:40,773 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:40,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,798 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:40,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:40,808 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:40,917 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:40,918 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:40,918 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:40,918 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:40,918 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2022-02-21 03:24:40,918 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:40,918 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:40,919 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:40,919 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration1_Loop
[2022-02-21 03:24:40,919 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:40,919 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:40,932 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,939 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,943 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,946 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,037 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:41,043 INFO  L404          LassoAnalysis]: Checking for nontermination...
[2022-02-21 03:24:41,045 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,045 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,047 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:41,049 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:41,050 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:41,050 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:41,076 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:41,076 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:41,100 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:41,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,100 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,103 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:41,114 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:41,115 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:41,127 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:41,134 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:41,134 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:41,161 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:41,161 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,161 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,163 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:41,165 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:41,167 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:41,167 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:41,196 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:41,196 INFO  L440          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=1, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=1, ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2022-02-21 03:24:41,219 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:41,219 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,220 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,228 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:41,231 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:41,232 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:41,232 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:41,289 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:41,289 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,290 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,291 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:41,292 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:41,293 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2022-02-21 03:24:41,293 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:41,428 INFO  L444          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2022-02-21 03:24:41,431 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0
[2022-02-21 03:24:41,432 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:41,432 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:41,432 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:41,432 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:41,432 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2022-02-21 03:24:41,432 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,432 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:41,432 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:41,432 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration1_Loop
[2022-02-21 03:24:41,432 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:41,432 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:41,434 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,455 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,461 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,471 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,543 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:41,547 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2022-02-21 03:24:41,548 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,549 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,550 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:41,552 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:41,557 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,567 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:41,567 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:41,567 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:41,567 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:41,576 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:41,577 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:41,603 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:41,619 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:41,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,620 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,621 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:41,622 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:41,623 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,631 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:41,631 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:41,631 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:41,631 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:41,634 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:41,634 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:41,646 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:41,670 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:41,671 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,671 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,672 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:41,673 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:41,674 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,681 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:41,681 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:41,681 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:41,682 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:41,682 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:41,682 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:41,682 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:41,696 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:41,713 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:41,713 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,713 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,714 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:41,715 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:41,716 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,722 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:41,722 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:41,723 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:41,723 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:41,723 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:41,724 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:41,725 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:41,727 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2022-02-21 03:24:41,737 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2022-02-21 03:24:41,737 INFO  L444   ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero.
[2022-02-21 03:24:41,739 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:41,739 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:41,741 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:41,742 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:41,792 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2022-02-21 03:24:41,792 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2022-02-21 03:24:41,792 INFO  L513          LassoAnalysis]: Proved termination.
[2022-02-21 03:24:41,792 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~m~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~m~0#1
Supporting invariants []
[2022-02-21 03:24:41,812 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:41,823 INFO  L297   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2022-02-21 03:24:41,827 INFO  L390             LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);" "assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1;" 
[2022-02-21 03:24:41,831 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:41,852 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:41,860 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:41,862 INFO  L263         TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:41,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:41,866 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:41,879 INFO  L290        TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID
[2022-02-21 03:24:41,880 INFO  L290        TraceCheckUtils]: 1: Hoare triple {19#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {19#unseeded} is VALID
[2022-02-21 03:24:41,880 INFO  L290        TraceCheckUtils]: 2: Hoare triple {19#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {19#unseeded} is VALID
[2022-02-21 03:24:41,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:41,886 WARN  L261         TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:41,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:41,890 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:41,897 INFO  L290        TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {22#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID
[2022-02-21 03:24:41,898 INFO  L290        TraceCheckUtils]: 1: Hoare triple {22#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {32#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID
[2022-02-21 03:24:41,899 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,919 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:41,924 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:41,926 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 2 letters.
[2022-02-21 03:24:41,928 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:41,931 INFO  L152   lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates 
[2022-02-21 03:24:41,932 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 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:41,998 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand  has 3 states, 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 29 states and 36 transitions. Complement of second has 6 states.
[2022-02-21 03:24:41,999 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:41,999 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:41,999 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,001 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:42,001 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:42,001 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:42,001 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:42,004 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 3
[2022-02-21 03:24:42,014 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:42,015 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:42,015 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions.
[2022-02-21 03:24:42,017 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:42,017 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:42,017 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:42,019 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,020 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:42,021 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:42,021 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:42,023 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 3
[2022-02-21 03:24:42,025 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:42,025 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9
[2022-02-21 03:24:42,026 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:42,026 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters.
[2022-02-21 03:24:42,026 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,027 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 2 letters.
[2022-02-21 03:24:42,027 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,027 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters.
[2022-02-21 03:24:42,027 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,028 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:42,028 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,028 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:42,028 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,028 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:42,028 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,029 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:42,029 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,029 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 2 letters.
[2022-02-21 03:24:42,029 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,029 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:42,030 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,032 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 29 letters.
[2022-02-21 03:24:42,032 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,032 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 29 letters. Loop has 29 letters.
[2022-02-21 03:24:42,033 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,033 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters.
[2022-02-21 03:24:42,033 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,033 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters.
[2022-02-21 03:24:42,034 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,034 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 9 letters.
[2022-02-21 03:24:42,034 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,034 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters.
[2022-02-21 03:24:42,034 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,035 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters.
[2022-02-21 03:24:42,035 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,035 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 4 letters.
[2022-02-21 03:24:42,035 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,035 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters.
[2022-02-21 03:24:42,035 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,036 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters.
[2022-02-21 03:24:42,036 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,036 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 2 letters.
[2022-02-21 03:24:42,036 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,036 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters.
[2022-02-21 03:24:42,037 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,037 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters.
[2022-02-21 03:24:42,037 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,037 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 2 letters.
[2022-02-21 03:24:42,037 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,038 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters.
[2022-02-21 03:24:42,038 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,038 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters.
[2022-02-21 03:24:42,038 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,038 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:42,040 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,040 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters.
[2022-02-21 03:24:42,041 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,041 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:42,041 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,041 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:42,041 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,042 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:42,042 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,042 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:42,042 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,042 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 2 letters.
[2022-02-21 03:24:42,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:42,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters.
[2022-02-21 03:24:42,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,044 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 2 letters.
[2022-02-21 03:24:42,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,044 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters.
[2022-02-21 03:24:42,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,044 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:42,049 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:42,051 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions.
[2022-02-21 03:24:42,052 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 2 letters.
[2022-02-21 03:24:42,052 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,052 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:42,052 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,052 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:42,053 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:42,053 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 9
[2022-02-21 03:24:42,058 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:42,061 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 9 states and 12 transitions.
[2022-02-21 03:24:42,062 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 6
[2022-02-21 03:24:42,063 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 7
[2022-02-21 03:24:42,063 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions.
[2022-02-21 03:24:42,063 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2022-02-21 03:24:42,063 INFO  L681         BuchiCegarLoop]: Abstraction has 9 states and 12 transitions.
[2022-02-21 03:24:42,075 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions.
[2022-02-21 03:24:42,080 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9.
[2022-02-21 03:24:42,080 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-21 03:24:42,080 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,081 INFO  L74              IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,083 INFO  L87              Difference]: Start difference. First operand 9 states and 12 transitions. Second operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,085 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:42,086 INFO  L93              Difference]: Finished difference Result 9 states and 12 transitions.
[2022-02-21 03:24:42,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions.
[2022-02-21 03:24:42,087 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:42,087 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:42,088 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions.
[2022-02-21 03:24:42,088 INFO  L87              Difference]: Start difference. First operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions.
[2022-02-21 03:24:42,089 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:42,090 INFO  L93              Difference]: Finished difference Result 9 states and 12 transitions.
[2022-02-21 03:24:42,090 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions.
[2022-02-21 03:24:42,090 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:42,090 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:42,090 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-21 03:24:42,091 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-21 03:24:42,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:42,092 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions.
[2022-02-21 03:24:42,093 INFO  L704         BuchiCegarLoop]: Abstraction has 9 states and 12 transitions.
[2022-02-21 03:24:42,093 INFO  L587         BuchiCegarLoop]: Abstraction has 9 states and 12 transitions.
[2022-02-21 03:24:42,093 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2022-02-21 03:24:42,093 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions.
[2022-02-21 03:24:42,094 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:42,094 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:42,094 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:42,095 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1]
[2022-02-21 03:24:42,095 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2022-02-21 03:24:42,095 INFO  L791   eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 86#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 83#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; 84#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 87#L21 assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; 88#L21-2 
[2022-02-21 03:24:42,095 INFO  L793   eck$LassoCheckResult]: Loop: 88#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 91#L21 assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; 88#L21-2 
[2022-02-21 03:24:42,096 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:42,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 28693991, now seen corresponding path program 1 times
[2022-02-21 03:24:42,096 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:42,096 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734864910]
[2022-02-21 03:24:42,097 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:42,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:42,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:42,145 INFO  L290        TraceCheckUtils]: 0: Hoare triple {141#true} assume { :begin_inline_ULTIMATE.init } true; {141#true} is VALID
[2022-02-21 03:24:42,145 INFO  L290        TraceCheckUtils]: 1: Hoare triple {141#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {141#true} is VALID
[2022-02-21 03:24:42,146 INFO  L290        TraceCheckUtils]: 2: Hoare triple {141#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {143#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:42,146 INFO  L290        TraceCheckUtils]: 3: Hoare triple {143#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {143#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:42,147 INFO  L290        TraceCheckUtils]: 4: Hoare triple {143#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {142#false} is VALID
[2022-02-21 03:24:42,147 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,147 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-21 03:24:42,147 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734864910]
[2022-02-21 03:24:42,148 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734864910] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-21 03:24:42,148 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2022-02-21 03:24:42,148 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2022-02-21 03:24:42,148 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689051320]
[2022-02-21 03:24:42,149 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-21 03:24:42,150 INFO  L796   eck$LassoCheckResult]: stem already infeasible
[2022-02-21 03:24:42,151 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:42,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 2 times
[2022-02-21 03:24:42,151 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:42,151 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788316115]
[2022-02-21 03:24:42,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:42,151 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:42,157 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:42,157 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:42,159 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:42,160 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:42,189 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:42,189 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:42,189 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:42,190 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:42,190 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2022-02-21 03:24:42,190 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,190 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:42,190 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:42,190 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration2_Loop
[2022-02-21 03:24:42,190 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:42,190 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:42,191 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,201 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,204 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,212 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,289 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:42,289 INFO  L404          LassoAnalysis]: Checking for nontermination...
[2022-02-21 03:24:42,290 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,290 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,292 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:42,302 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:42,303 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:42,316 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:42,332 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:42,332 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:42,352 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:42,352 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,352 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,353 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:42,354 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:42,356 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:42,356 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:42,367 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:42,368 INFO  L440          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2022-02-21 03:24:42,390 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:42,390 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,391 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,391 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:42,392 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:42,394 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:42,394 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:42,408 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:42,408 INFO  L440          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0#1=1, ULTIMATE.start_main_~i~0#1=0} Honda state: {ULTIMATE.start_main_~n~0#1=1, ULTIMATE.start_main_~i~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2022-02-21 03:24:42,428 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0
[2022-02-21 03:24:42,429 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,429 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,430 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:42,433 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:42,434 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:42,434 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:42,457 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:42,458 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,458 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,459 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:42,460 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:42,462 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2022-02-21 03:24:42,462 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:42,497 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0
[2022-02-21 03:24:42,600 INFO  L444          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2022-02-21 03:24:42,603 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:42,604 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:42,604 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:42,604 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:42,604 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:42,604 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2022-02-21 03:24:42,604 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,604 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:42,604 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:42,604 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration2_Loop
[2022-02-21 03:24:42,604 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:42,604 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:42,605 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,611 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,615 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,618 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,685 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:42,685 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2022-02-21 03:24:42,686 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,686 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,688 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:42,696 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:42,697 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,704 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:42,704 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:42,704 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:42,704 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:42,707 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:42,707 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:42,710 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:42,725 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0
[2022-02-21 03:24:42,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,727 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,728 INFO  L229       MonitoredProcess]: Starting monitored process 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:42,729 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:42,730 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,736 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:42,737 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:42,737 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:42,737 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:42,738 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:42,739 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:42,759 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:42,785 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:42,786 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,786 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,787 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:42,794 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:42,794 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,802 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:42,802 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:42,803 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:42,803 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:42,803 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:42,803 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:42,804 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:42,807 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:42,823 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:42,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,824 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,825 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:42,829 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:42,829 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,836 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:42,837 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:42,837 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:42,837 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:42,837 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:42,838 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:42,838 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:42,853 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2022-02-21 03:24:42,856 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2022-02-21 03:24:42,856 INFO  L444   ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero.
[2022-02-21 03:24:42,857 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:42,857 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:42,858 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:42,882 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:42,891 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2022-02-21 03:24:42,891 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2022-02-21 03:24:42,892 INFO  L513          LassoAnalysis]: Proved termination.
[2022-02-21 03:24:42,892 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~m~0#1, ULTIMATE.start_main_~j~0#1) = 1*ULTIMATE.start_main_~m~0#1 - 1*ULTIMATE.start_main_~j~0#1
Supporting invariants []
[2022-02-21 03:24:42,926 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:42,939 INFO  L297   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2022-02-21 03:24:42,943 INFO  L390             LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);" "assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1;" 
[2022-02-21 03:24:42,946 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:42,968 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:42,975 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:42,976 INFO  L263         TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:42,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:42,982 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:42,992 INFO  L290        TraceCheckUtils]: 0: Hoare triple {146#unseeded} assume { :begin_inline_ULTIMATE.init } true; {146#unseeded} is VALID
[2022-02-21 03:24:42,992 INFO  L290        TraceCheckUtils]: 1: Hoare triple {146#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {146#unseeded} is VALID
[2022-02-21 03:24:42,993 INFO  L290        TraceCheckUtils]: 2: Hoare triple {146#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {146#unseeded} is VALID
[2022-02-21 03:24:42,993 INFO  L290        TraceCheckUtils]: 3: Hoare triple {146#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {146#unseeded} is VALID
[2022-02-21 03:24:42,994 INFO  L290        TraceCheckUtils]: 4: Hoare triple {146#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {146#unseeded} is VALID
[2022-02-21 03:24:42,998 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:42,998 WARN  L261         TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:43,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,003 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:43,019 INFO  L290        TraceCheckUtils]: 0: Hoare triple {149#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {149#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID
[2022-02-21 03:24:43,020 INFO  L290        TraceCheckUtils]: 1: Hoare triple {149#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {159#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID
[2022-02-21 03:24:43,020 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:43,021 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:43,029 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:43,030 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,030 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,031 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:43,031 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:43,065 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 13 states and 18 transitions. Complement of second has 5 states.
[2022-02-21 03:24:43,067 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:43,068 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:43,068 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. cyclomatic complexity: 5
[2022-02-21 03:24:43,068 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,068 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,068 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:43,069 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,070 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,071 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,071 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions.
[2022-02-21 03:24:43,072 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,074 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,074 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,074 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 5
[2022-02-21 03:24:43,075 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:43,076 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:43,077 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,079 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:43,079 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 8
[2022-02-21 03:24:43,080 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:43,080 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:43,080 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,080 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,081 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,081 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:43,082 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,082 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,082 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,082 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:43,082 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,083 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,083 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,083 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters.
[2022-02-21 03:24:43,083 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,083 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,084 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,084 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters.
[2022-02-21 03:24:43,085 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,085 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:43,085 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,086 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 13 letters.
[2022-02-21 03:24:43,087 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,087 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:43,087 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,087 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters.
[2022-02-21 03:24:43,087 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,087 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 9 letters.
[2022-02-21 03:24:43,087 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,088 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters.
[2022-02-21 03:24:43,088 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,088 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:43,088 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,088 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:43,088 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,088 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:43,088 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,089 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:43,089 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,090 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,090 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,091 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:43,091 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,091 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters.
[2022-02-21 03:24:43,091 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,092 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,092 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,092 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters.
[2022-02-21 03:24:43,092 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,092 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,093 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,093 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:43,093 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,093 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,093 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,093 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters.
[2022-02-21 03:24:43,093 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,094 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,094 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,094 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters.
[2022-02-21 03:24:43,094 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,095 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters.
[2022-02-21 03:24:43,096 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,096 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 2 letters.
[2022-02-21 03:24:43,096 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,096 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters.
[2022-02-21 03:24:43,097 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,097 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:43,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:43,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions.
[2022-02-21 03:24:43,100 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters.
[2022-02-21 03:24:43,100 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,100 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters.
[2022-02-21 03:24:43,100 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,100 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters.
[2022-02-21 03:24:43,101 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,101 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. cyclomatic complexity: 8
[2022-02-21 03:24:43,102 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,103 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions.
[2022-02-21 03:24:43,103 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 8
[2022-02-21 03:24:43,103 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2022-02-21 03:24:43,104 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions.
[2022-02-21 03:24:43,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2022-02-21 03:24:43,104 INFO  L681         BuchiCegarLoop]: Abstraction has 13 states and 18 transitions.
[2022-02-21 03:24:43,104 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions.
[2022-02-21 03:24:43,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2022-02-21 03:24:43,106 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-21 03:24:43,106 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:43,108 INFO  L74              IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:43,108 INFO  L87              Difference]: Start difference. First operand 13 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:43,110 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:43,112 INFO  L93              Difference]: Finished difference Result 13 states and 18 transitions.
[2022-02-21 03:24:43,118 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions.
[2022-02-21 03:24:43,119 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:43,119 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:43,119 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions.
[2022-02-21 03:24:43,119 INFO  L87              Difference]: Start difference. First operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions.
[2022-02-21 03:24:43,120 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:43,121 INFO  L93              Difference]: Finished difference Result 13 states and 18 transitions.
[2022-02-21 03:24:43,121 INFO  L276                IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions.
[2022-02-21 03:24:43,122 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:43,122 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:43,122 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-21 03:24:43,122 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-21 03:24:43,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 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:43,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions.
[2022-02-21 03:24:43,123 INFO  L704         BuchiCegarLoop]: Abstraction has 13 states and 18 transitions.
[2022-02-21 03:24:43,123 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-21 03:24:43,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2022-02-21 03:24:43,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2022-02-21 03:24:43,129 INFO  L87              Difference]: Start difference. First operand 13 states and 18 transitions. Second operand  has 3 states, 2 states have (on average 2.5) 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:43,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-21 03:24:43,140 INFO  L93              Difference]: Finished difference Result 15 states and 19 transitions.
[2022-02-21 03:24:43,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2022-02-21 03:24:43,141 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 2 states have (on average 2.5) 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:43,146 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:43,147 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions.
[2022-02-21 03:24:43,152 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,153 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 14 states and 18 transitions.
[2022-02-21 03:24:43,153 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 9
[2022-02-21 03:24:43,153 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2022-02-21 03:24:43,153 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions.
[2022-02-21 03:24:43,153 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2022-02-21 03:24:43,153 INFO  L681         BuchiCegarLoop]: Abstraction has 14 states and 18 transitions.
[2022-02-21 03:24:43,153 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions.
[2022-02-21 03:24:43,154 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13.
[2022-02-21 03:24:43,154 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-21 03:24:43,154 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 14 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:43,154 INFO  L74              IsIncluded]: Start isIncluded. First operand 14 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:43,155 INFO  L87              Difference]: Start difference. First operand 14 states and 18 transitions. Second operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:43,155 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:43,156 INFO  L93              Difference]: Finished difference Result 14 states and 18 transitions.
[2022-02-21 03:24:43,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2022-02-21 03:24:43,156 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:43,156 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:43,156 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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 14 states and 18 transitions.
[2022-02-21 03:24:43,156 INFO  L87              Difference]: Start difference. First operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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 14 states and 18 transitions.
[2022-02-21 03:24:43,157 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:43,158 INFO  L93              Difference]: Finished difference Result 14 states and 18 transitions.
[2022-02-21 03:24:43,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 14 states and 18 transitions.
[2022-02-21 03:24:43,158 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:43,158 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:43,158 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-21 03:24:43,158 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-21 03:24:43,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 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:43,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions.
[2022-02-21 03:24:43,159 INFO  L704         BuchiCegarLoop]: Abstraction has 13 states and 17 transitions.
[2022-02-21 03:24:43,159 INFO  L587         BuchiCegarLoop]: Abstraction has 13 states and 17 transitions.
[2022-02-21 03:24:43,159 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2022-02-21 03:24:43,159 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions.
[2022-02-21 03:24:43,159 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,160 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,160 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,160 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1]
[2022-02-21 03:24:43,160 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1]
[2022-02-21 03:24:43,160 INFO  L791   eck$LassoCheckResult]: Stem: 291#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 292#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 289#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; 290#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 298#L21 assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; 301#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 299#L21 assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; 300#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 293#L21 assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; 294#L21-2 
[2022-02-21 03:24:43,160 INFO  L793   eck$LassoCheckResult]: Loop: 294#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 297#L21 assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; 294#L21-2 
[2022-02-21 03:24:43,161 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:43,161 INFO  L85        PathProgramCache]: Analyzing trace with hash -446365265, now seen corresponding path program 1 times
[2022-02-21 03:24:43,161 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:43,161 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281843422]
[2022-02-21 03:24:43,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:43,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:43,184 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,213 INFO  L290        TraceCheckUtils]: 0: Hoare triple {373#true} assume { :begin_inline_ULTIMATE.init } true; {373#true} is VALID
[2022-02-21 03:24:43,214 INFO  L290        TraceCheckUtils]: 1: Hoare triple {373#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {373#true} is VALID
[2022-02-21 03:24:43,214 INFO  L290        TraceCheckUtils]: 2: Hoare triple {373#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,215 INFO  L290        TraceCheckUtils]: 3: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,216 INFO  L290        TraceCheckUtils]: 4: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,216 INFO  L290        TraceCheckUtils]: 5: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,217 INFO  L290        TraceCheckUtils]: 6: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {376#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,217 INFO  L290        TraceCheckUtils]: 7: Hoare triple {376#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {376#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,219 INFO  L290        TraceCheckUtils]: 8: Hoare triple {376#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID
[2022-02-21 03:24:43,219 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-02-21 03:24:43,219 INFO  L144   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2022-02-21 03:24:43,219 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281843422]
[2022-02-21 03:24:43,220 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281843422] provided 0 perfect and 1 imperfect interpolant sequences
[2022-02-21 03:24:43,220 INFO  L338   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605492940]
[2022-02-21 03:24:43,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:43,220 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2022-02-21 03:24:43,220 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:43,221 INFO  L229       MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2022-02-21 03:24:43,223 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process
[2022-02-21 03:24:43,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,261 INFO  L263         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 3 conjunts are in the unsatisfiable core
[2022-02-21 03:24:43,266 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,267 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:43,352 INFO  L290        TraceCheckUtils]: 0: Hoare triple {373#true} assume { :begin_inline_ULTIMATE.init } true; {373#true} is VALID
[2022-02-21 03:24:43,353 INFO  L290        TraceCheckUtils]: 1: Hoare triple {373#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {373#true} is VALID
[2022-02-21 03:24:43,353 INFO  L290        TraceCheckUtils]: 2: Hoare triple {373#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,354 INFO  L290        TraceCheckUtils]: 3: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,354 INFO  L290        TraceCheckUtils]: 4: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,355 INFO  L290        TraceCheckUtils]: 5: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !!(main_~i~0#1 < main_~n~0#1); {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} is VALID
[2022-02-21 03:24:43,356 INFO  L290        TraceCheckUtils]: 6: Hoare triple {375#(<= 1 |ULTIMATE.start_main_~m~0#1|)} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {398#(and (<= 1 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID
[2022-02-21 03:24:43,356 INFO  L290        TraceCheckUtils]: 7: Hoare triple {398#(and (<= 1 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~i~0#1 < main_~n~0#1); {398#(and (<= 1 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID
[2022-02-21 03:24:43,357 INFO  L290        TraceCheckUtils]: 8: Hoare triple {398#(and (<= 1 |ULTIMATE.start_main_~m~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {374#false} is VALID
[2022-02-21 03:24:43,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2022-02-21 03:24:43,357 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2022-02-21 03:24:43,357 INFO  L165   FreeRefinementEngine]: IpTcStrategyModuleZ3 [605492940] provided 1 perfect and 0 imperfect interpolant sequences
[2022-02-21 03:24:43,357 INFO  L191   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2022-02-21 03:24:43,357 INFO  L204   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4
[2022-02-21 03:24:43,357 INFO  L118   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165403742]
[2022-02-21 03:24:43,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2022-02-21 03:24:43,357 INFO  L796   eck$LassoCheckResult]: stem already infeasible
[2022-02-21 03:24:43,358 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:43,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 3 times
[2022-02-21 03:24:43,358 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:43,358 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513604966]
[2022-02-21 03:24:43,359 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:43,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:43,363 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:43,363 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:43,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:43,366 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:43,384 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:43,385 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:43,385 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:43,385 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:43,385 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2022-02-21 03:24:43,385 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,385 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:43,385 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:43,385 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration3_Loop
[2022-02-21 03:24:43,385 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:43,385 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:43,386 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:43,391 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:43,394 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:43,396 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:43,468 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:43,468 INFO  L404          LassoAnalysis]: Checking for nontermination...
[2022-02-21 03:24:43,469 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,469 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:43,470 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:43,480 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:43,480 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:43,489 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:43,511 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0
[2022-02-21 03:24:43,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,512 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:43,513 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:43,514 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:43,515 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2022-02-21 03:24:43,516 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:43,645 INFO  L444          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2022-02-21 03:24:43,649 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:43,649 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:43,649 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:43,649 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:43,649 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:43,649 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2022-02-21 03:24:43,649 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,649 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:43,649 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:43,649 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration3_Loop
[2022-02-21 03:24:43,649 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:43,649 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:43,650 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:43,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:43,661 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:43,664 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:43,725 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:43,725 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2022-02-21 03:24:43,725 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,726 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:43,728 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:43,732 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:43,737 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:43,748 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:43,748 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:43,748 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:43,748 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:43,748 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:43,749 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:43,749 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:43,774 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2022-02-21 03:24:43,774 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:43,777 INFO  L443   ModelExtractionUtils]: Simplification made 3 calls to the SMT solver.
[2022-02-21 03:24:43,777 INFO  L444   ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero.
[2022-02-21 03:24:43,777 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:43,777 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:43,778 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:43,779 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:43,780 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2022-02-21 03:24:43,780 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2022-02-21 03:24:43,780 INFO  L513          LassoAnalysis]: Proved termination.
[2022-02-21 03:24:43,780 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~j~0#1, ULTIMATE.start_main_~m~0#1) = -1*ULTIMATE.start_main_~j~0#1 + 1*ULTIMATE.start_main_~m~0#1
Supporting invariants []
[2022-02-21 03:24:43,796 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0
[2022-02-21 03:24:43,807 INFO  L297   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2022-02-21 03:24:43,811 INFO  L390             LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);" "assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1;" 
[2022-02-21 03:24:43,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,832 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:43,849 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,850 INFO  L263         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:43,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,854 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:43,879 INFO  L290        TraceCheckUtils]: 0: Hoare triple {404#unseeded} assume { :begin_inline_ULTIMATE.init } true; {404#unseeded} is VALID
[2022-02-21 03:24:43,879 INFO  L290        TraceCheckUtils]: 1: Hoare triple {404#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,880 INFO  L290        TraceCheckUtils]: 2: Hoare triple {404#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {404#unseeded} is VALID
[2022-02-21 03:24:43,880 INFO  L290        TraceCheckUtils]: 3: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,880 INFO  L290        TraceCheckUtils]: 4: Hoare triple {404#unseeded} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,881 INFO  L290        TraceCheckUtils]: 5: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,881 INFO  L290        TraceCheckUtils]: 6: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,881 INFO  L290        TraceCheckUtils]: 7: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,882 INFO  L290        TraceCheckUtils]: 8: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,886 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,886 WARN  L261         TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:43,890 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,891 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:43,898 INFO  L290        TraceCheckUtils]: 0: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID
[2022-02-21 03:24:43,899 INFO  L290        TraceCheckUtils]: 1: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {417#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID
[2022-02-21 03:24:43,899 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:43,899 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:43,905 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:43,905 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,906 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,906 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:43,906 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:43,926 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7. Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 21 transitions. Complement of second has 5 states.
[2022-02-21 03:24:43,926 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:43,926 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:43,926 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:43,926 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,926 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,927 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:43,927 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,927 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,927 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,928 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions.
[2022-02-21 03:24:43,928 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,928 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:43,928 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:43,929 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:43,929 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:43,929 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:43,930 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:43,930 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:43,930 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 9
[2022-02-21 03:24:43,931 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:43,931 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,931 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,931 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,931 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,931 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,932 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,932 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,932 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,932 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,932 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,932 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,932 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,933 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,933 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,933 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,933 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,933 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,933 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,933 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:43,933 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,934 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:43,934 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,934 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:43,934 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,934 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:43,934 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,934 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:43,935 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,935 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:43,935 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,935 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:43,935 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,935 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:43,935 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,935 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:43,935 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,936 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,936 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,936 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,936 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,936 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,936 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,936 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,937 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,937 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,937 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,937 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,937 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,937 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,937 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,938 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,938 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,938 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:43,938 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,938 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,938 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,938 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,939 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,939 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,939 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,939 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,939 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,939 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,939 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,940 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:43,940 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,940 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:43,941 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:43,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions.
[2022-02-21 03:24:43,941 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:43,941 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:43,941 INFO  L634            RefineBuchi]: Bad chosen interpolant automaton: word not accepted
[2022-02-21 03:24:43,952 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:43,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,963 INFO  L263         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:43,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:43,971 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:43,990 INFO  L290        TraceCheckUtils]: 0: Hoare triple {404#unseeded} assume { :begin_inline_ULTIMATE.init } true; {404#unseeded} is VALID
[2022-02-21 03:24:43,991 INFO  L290        TraceCheckUtils]: 1: Hoare triple {404#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,991 INFO  L290        TraceCheckUtils]: 2: Hoare triple {404#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {404#unseeded} is VALID
[2022-02-21 03:24:43,991 INFO  L290        TraceCheckUtils]: 3: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,994 INFO  L290        TraceCheckUtils]: 4: Hoare triple {404#unseeded} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,995 INFO  L290        TraceCheckUtils]: 5: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,995 INFO  L290        TraceCheckUtils]: 6: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:43,996 INFO  L290        TraceCheckUtils]: 7: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:43,996 INFO  L290        TraceCheckUtils]: 8: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:44,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,000 WARN  L261         TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:44,003 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,004 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:44,010 INFO  L290        TraceCheckUtils]: 0: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID
[2022-02-21 03:24:44,012 INFO  L290        TraceCheckUtils]: 1: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {417#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID
[2022-02-21 03:24:44,012 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:44,013 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,019 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:44,019 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,019 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,020 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:44,020 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,038 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7. Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 15 states and 21 transitions. Complement of second has 5 states.
[2022-02-21 03:24:44,038 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:44,039 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:44,039 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:44,039 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,039 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,039 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,040 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:44,040 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,040 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,040 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions.
[2022-02-21 03:24:44,040 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:44,040 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,041 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,041 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:44,041 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:44,041 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,042 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:44,042 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:44,042 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 9
[2022-02-21 03:24:44,043 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:44,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,043 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,043 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,044 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,044 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,044 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,044 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:44,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,045 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:44,045 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,046 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters.
[2022-02-21 03:24:44,046 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,046 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,046 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,046 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,046 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,046 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,046 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,046 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,047 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,047 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,047 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,047 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,047 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,047 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,047 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,047 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,048 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,048 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,048 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,048 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,048 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,048 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,048 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,048 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,048 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,049 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,049 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,049 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,049 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,049 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,049 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,049 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,049 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,050 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,050 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,050 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,050 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,050 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,050 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,050 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,050 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,051 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,051 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,051 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:44,051 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions.
[2022-02-21 03:24:44,052 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,052 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,052 INFO  L634            RefineBuchi]: Bad chosen interpolant automaton: word not accepted
[2022-02-21 03:24:44,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:44,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,075 INFO  L263         TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:44,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,079 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:44,095 INFO  L290        TraceCheckUtils]: 0: Hoare triple {404#unseeded} assume { :begin_inline_ULTIMATE.init } true; {404#unseeded} is VALID
[2022-02-21 03:24:44,095 INFO  L290        TraceCheckUtils]: 1: Hoare triple {404#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {404#unseeded} is VALID
[2022-02-21 03:24:44,096 INFO  L290        TraceCheckUtils]: 2: Hoare triple {404#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {404#unseeded} is VALID
[2022-02-21 03:24:44,096 INFO  L290        TraceCheckUtils]: 3: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:44,096 INFO  L290        TraceCheckUtils]: 4: Hoare triple {404#unseeded} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:44,097 INFO  L290        TraceCheckUtils]: 5: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:44,097 INFO  L290        TraceCheckUtils]: 6: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:44,097 INFO  L290        TraceCheckUtils]: 7: Hoare triple {404#unseeded} assume !!(main_~i~0#1 < main_~n~0#1); {404#unseeded} is VALID
[2022-02-21 03:24:44,098 INFO  L290        TraceCheckUtils]: 8: Hoare triple {404#unseeded} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {404#unseeded} is VALID
[2022-02-21 03:24:44,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,102 WARN  L261         TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:44,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:44,105 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:44,111 INFO  L290        TraceCheckUtils]: 0: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} is VALID
[2022-02-21 03:24:44,112 INFO  L290        TraceCheckUtils]: 1: Hoare triple {407#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {417#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~m~0#1|))))} is VALID
[2022-02-21 03:24:44,112 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:44,113 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,117 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:44,117 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,118 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,118 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:44,118 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7 Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,135 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 17 transitions. cyclomatic complexity: 7. Second operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 17 states and 24 transitions. Complement of second has 4 states.
[2022-02-21 03:24:44,135 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:44,136 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:44,136 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:44,136 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,136 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,136 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,137 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:44,137 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,137 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,137 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions.
[2022-02-21 03:24:44,137 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 4
[2022-02-21 03:24:44,137 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,137 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,138 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7
[2022-02-21 03:24:44,138 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:44,138 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,139 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:44,139 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:44,139 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 17 states and 24 transitions. cyclomatic complexity: 10
[2022-02-21 03:24:44,139 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:44,139 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,139 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,139 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,140 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,140 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,140 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,140 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,140 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,140 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,140 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,140 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,141 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,141 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,141 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,141 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,141 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,141 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,141 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,141 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 17 letters. Loop has 17 letters.
[2022-02-21 03:24:44,142 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,142 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 17 letters.
[2022-02-21 03:24:44,142 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,142 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 17 letters. Loop has 17 letters.
[2022-02-21 03:24:44,142 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,142 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,142 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,142 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,143 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,143 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters.
[2022-02-21 03:24:44,143 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,143 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,143 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,143 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,143 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,143 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:44,143 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,144 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,144 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,144 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,144 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,144 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,144 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,144 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,144 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,145 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,145 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,145 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 2 letters.
[2022-02-21 03:24:44,145 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,145 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,145 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,145 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,145 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,146 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:44,146 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,146 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,146 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,147 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,147 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,147 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 17 states and 24 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,147 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,147 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:44,148 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2022-02-21 03:24:44,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions.
[2022-02-21 03:24:44,149 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 2 letters.
[2022-02-21 03:24:44,149 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,149 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters.
[2022-02-21 03:24:44,149 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,149 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 4 letters.
[2022-02-21 03:24:44,149 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:44,149 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 24 transitions. cyclomatic complexity: 10
[2022-02-21 03:24:44,150 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 4
[2022-02-21 03:24:44,151 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 15 states and 20 transitions.
[2022-02-21 03:24:44,151 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 7
[2022-02-21 03:24:44,151 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 9
[2022-02-21 03:24:44,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions.
[2022-02-21 03:24:44,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2022-02-21 03:24:44,152 INFO  L681         BuchiCegarLoop]: Abstraction has 15 states and 20 transitions.
[2022-02-21 03:24:44,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions.
[2022-02-21 03:24:44,152 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 8.
[2022-02-21 03:24:44,152 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-21 03:24:44,153 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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:44,153 INFO  L74              IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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:44,153 INFO  L87              Difference]: Start difference. First operand 15 states and 20 transitions. Second operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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:44,153 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:44,154 INFO  L93              Difference]: Finished difference Result 16 states and 21 transitions.
[2022-02-21 03:24:44,154 INFO  L276                IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions.
[2022-02-21 03:24:44,154 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:44,154 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:44,155 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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) Second operand 15 states and 20 transitions.
[2022-02-21 03:24:44,155 INFO  L87              Difference]: Start difference. First operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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) Second operand 15 states and 20 transitions.
[2022-02-21 03:24:44,155 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:44,156 INFO  L93              Difference]: Finished difference Result 16 states and 21 transitions.
[2022-02-21 03:24:44,156 INFO  L276                IsEmpty]: Start isEmpty. Operand 16 states and 21 transitions.
[2022-02-21 03:24:44,156 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:44,156 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:44,157 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-21 03:24:44,157 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-21 03:24:44,157 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 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:44,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions.
[2022-02-21 03:24:44,157 INFO  L704         BuchiCegarLoop]: Abstraction has 8 states and 10 transitions.
[2022-02-21 03:24:44,157 INFO  L108   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2022-02-21 03:24:44,158 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2022-02-21 03:24:44,158 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2022-02-21 03:24:44,158 INFO  L87              Difference]: Start difference. First operand 8 states and 10 transitions. Second operand  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,172 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2022-02-21 03:24:44,172 INFO  L93              Difference]: Finished difference Result 10 states and 11 transitions.
[2022-02-21 03:24:44,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2022-02-21 03:24:44,172 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,179 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:44,180 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions.
[2022-02-21 03:24:44,180 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 5
[2022-02-21 03:24:44,181 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 9 states and 10 transitions.
[2022-02-21 03:24:44,181 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 6
[2022-02-21 03:24:44,181 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 6
[2022-02-21 03:24:44,181 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions.
[2022-02-21 03:24:44,181 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is not deterministic.
[2022-02-21 03:24:44,181 INFO  L681         BuchiCegarLoop]: Abstraction has 9 states and 10 transitions.
[2022-02-21 03:24:44,181 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions.
[2022-02-21 03:24:44,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 7.
[2022-02-21 03:24:44,182 INFO  L214    AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2022-02-21 03:24:44,182 INFO  L82        GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,182 INFO  L74              IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,183 INFO  L87              Difference]: Start difference. First operand 9 states and 10 transitions. Second operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,183 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:44,184 INFO  L93              Difference]: Finished difference Result 9 states and 10 transitions.
[2022-02-21 03:24:44,184 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions.
[2022-02-21 03:24:44,184 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:44,184 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:44,184 INFO  L74              IsIncluded]: Start isIncluded. First operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 9 states and 10 transitions.
[2022-02-21 03:24:44,184 INFO  L87              Difference]: Start difference. First operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 9 states and 10 transitions.
[2022-02-21 03:24:44,185 INFO  L149             Difference]: Subtrahend was not deterministic. Recomputing result with determinization.
[2022-02-21 03:24:44,185 INFO  L93              Difference]: Finished difference Result 9 states and 10 transitions.
[2022-02-21 03:24:44,185 INFO  L276                IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions.
[2022-02-21 03:24:44,186 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2022-02-21 03:24:44,186 INFO  L83              IsIncluded]: Finished isIncluded. Language is included
[2022-02-21 03:24:44,186 INFO  L88        GeneralOperation]: Finished isEquivalent.
[2022-02-21 03:24:44,186 INFO  L221    AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2022-02-21 03:24:44,186 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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:44,186 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions.
[2022-02-21 03:24:44,187 INFO  L704         BuchiCegarLoop]: Abstraction has 7 states and 8 transitions.
[2022-02-21 03:24:44,187 INFO  L587         BuchiCegarLoop]: Abstraction has 7 states and 8 transitions.
[2022-02-21 03:24:44,187 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2022-02-21 03:24:44,187 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions.
[2022-02-21 03:24:44,187 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 4
[2022-02-21 03:24:44,187 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:44,187 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:44,188 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1]
[2022-02-21 03:24:44,188 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1]
[2022-02-21 03:24:44,188 INFO  L791   eck$LassoCheckResult]: Stem: 669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 670#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 667#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; 668#L21-2 
[2022-02-21 03:24:44,188 INFO  L793   eck$LassoCheckResult]: Loop: 668#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 672#L21 assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; 673#L21-2 assume !!(main_~i~0#1 < main_~n~0#1); 671#L21 assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; 668#L21-2 
[2022-02-21 03:24:44,188 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:44,188 INFO  L85        PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 2 times
[2022-02-21 03:24:44,189 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:44,189 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851785530]
[2022-02-21 03:24:44,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:44,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:44,193 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,194 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:44,196 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,197 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:44,197 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:44,198 INFO  L85        PathProgramCache]: Analyzing trace with hash 1357385, now seen corresponding path program 1 times
[2022-02-21 03:24:44,198 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:44,198 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052166922]
[2022-02-21 03:24:44,198 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:44,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:44,203 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,204 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:44,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,208 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:44,208 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:44,208 INFO  L85        PathProgramCache]: Analyzing trace with hash 1805120106, now seen corresponding path program 2 times
[2022-02-21 03:24:44,209 INFO  L126   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2022-02-21 03:24:44,209 INFO  L338   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332778241]
[2022-02-21 03:24:44,209 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2022-02-21 03:24:44,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2022-02-21 03:24:44,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,216 INFO  L352             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2022-02-21 03:24:44,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2022-02-21 03:24:44,221 INFO  L138   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2022-02-21 03:24:44,273 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:44,274 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:44,274 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:44,274 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:44,274 INFO  L129   ssoRankerPreferences]: Use exernal solver: true
[2022-02-21 03:24:44,275 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,275 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:44,275 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:44,276 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration4_Loop
[2022-02-21 03:24:44,276 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:44,276 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:44,277 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:44,280 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:44,285 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:44,288 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:44,345 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:44,345 INFO  L404          LassoAnalysis]: Checking for nontermination...
[2022-02-21 03:24:44,346 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,346 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,347 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:44,355 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:44,356 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:44,368 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:44,377 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:44,377 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:44,404 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:44,404 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,405 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,406 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:44,412 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:44,412 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:44,425 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:44,440 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:44,440 INFO  L440          LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~m~0#1=1} Honda state: {ULTIMATE.start_main_~j~0#1=0, ULTIMATE.start_main_~m~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: []
[2022-02-21 03:24:44,466 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:44,467 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,467 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,468 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:44,471 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:44,472 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:44,491 INFO  L437          LassoAnalysis]: Proved nontermination for one component.
[2022-02-21 03:24:44,491 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:44,515 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:44,530 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:44,541 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:44,542 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,542 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,543 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:44,548 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true
[2022-02-21 03:24:44,548 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:44,567 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:44,595 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:44,596 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,596 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,597 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:44,604 INFO  L148   nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true
[2022-02-21 03:24:44,604 INFO  L160   nArgumentSynthesizer]: Using integer mode.
[2022-02-21 03:24:44,615 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:44,725 INFO  L444          LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists.
[2022-02-21 03:24:44,729 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:44,729 INFO  L210          LassoAnalysis]: Preferences:
[2022-02-21 03:24:44,729 INFO  L126   ssoRankerPreferences]: Compute integeral hull: false
[2022-02-21 03:24:44,729 INFO  L127   ssoRankerPreferences]: Enable LassoPartitioneer: true
[2022-02-21 03:24:44,729 INFO  L128   ssoRankerPreferences]: Term annotations enabled: false
[2022-02-21 03:24:44,729 INFO  L129   ssoRankerPreferences]: Use exernal solver: false
[2022-02-21 03:24:44,729 INFO  L130   ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,729 INFO  L131   ssoRankerPreferences]: Dump SMT script to file: false
[2022-02-21 03:24:44,730 INFO  L132   ssoRankerPreferences]: Path of dumped script: 
[2022-02-21 03:24:44,730 INFO  L133   ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration4_Loop
[2022-02-21 03:24:44,730 INFO  L134   ssoRankerPreferences]: MapElimAlgo: Frank
[2022-02-21 03:24:44,730 INFO  L276          LassoAnalysis]: Starting lasso preprocessing...
[2022-02-21 03:24:44,731 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:44,737 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:44,743 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:44,753 INFO  L141          MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true
[2022-02-21 03:24:44,832 INFO  L294          LassoAnalysis]: Preprocessing complete.
[2022-02-21 03:24:44,832 INFO  L490          LassoAnalysis]: Using template 'affine'.
[2022-02-21 03:24:44,833 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,833 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,836 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:44,844 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:44,851 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:44,852 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:44,852 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:44,852 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:44,852 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:44,853 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:44,853 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:44,855 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:44,869 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:44,885 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:44,886 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,886 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,887 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:44,889 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:44,890 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:44,896 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:44,896 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:44,896 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:44,896 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:44,899 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:44,899 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:44,923 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:44,984 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0
[2022-02-21 03:24:44,985 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:44,985 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:44,986 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:44,988 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:44,989 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:44,996 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:44,996 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:44,996 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:44,997 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:44,998 INFO  L401   nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications.
[2022-02-21 03:24:44,998 INFO  L402   nArgumentSynthesizer]: A total of 2 supporting invariants were added.
[2022-02-21 03:24:45,012 INFO  L527          LassoAnalysis]: Proving termination failed for this template and these settings.
[2022-02-21 03:24:45,041 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:45,041 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:45,041 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:45,044 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:45,045 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:45,047 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:45,055 INFO  L338   nArgumentSynthesizer]: Template has degree 0.
[2022-02-21 03:24:45,055 INFO  L351   nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation.
[2022-02-21 03:24:45,055 INFO  L203   nArgumentSynthesizer]: 1 stem disjuncts
[2022-02-21 03:24:45,055 INFO  L204   nArgumentSynthesizer]: 1 loop disjuncts
[2022-02-21 03:24:45,055 INFO  L205   nArgumentSynthesizer]: 2 template conjuncts.
[2022-02-21 03:24:45,056 INFO  L401   nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications.
[2022-02-21 03:24:45,056 INFO  L402   nArgumentSynthesizer]: A total of 0 supporting invariants were added.
[2022-02-21 03:24:45,065 INFO  L420   nArgumentSynthesizer]: Found a termination argument, trying to simplify.
[2022-02-21 03:24:45,068 INFO  L443   ModelExtractionUtils]: Simplification made 4 calls to the SMT solver.
[2022-02-21 03:24:45,068 INFO  L444   ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero.
[2022-02-21 03:24:45,068 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2022-02-21 03:24:45,069 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2022-02-21 03:24:45,069 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:45,070 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:45,071 INFO  L435   nArgumentSynthesizer]: Simplifying supporting invariants...
[2022-02-21 03:24:45,071 INFO  L438   nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0.
[2022-02-21 03:24:45,072 INFO  L513          LassoAnalysis]: Proved termination.
[2022-02-21 03:24:45,072 INFO  L515          LassoAnalysis]: Termination argument consisting of:
Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~n~0#1
Supporting invariants []
[2022-02-21 03:24:45,088 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0
[2022-02-21 03:24:45,093 INFO  L297   tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed
[2022-02-21 03:24:45,101 INFO  L390             LassoCheck]: Loop: "assume !!(main_~i~0#1 < main_~n~0#1);" "assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1;" "assume !!(main_~i~0#1 < main_~n~0#1);" "assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1;" 
[2022-02-21 03:24:45,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:45,126 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2022-02-21 03:24:45,132 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:45,132 INFO  L263         TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core
[2022-02-21 03:24:45,136 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:45,137 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:45,144 INFO  L290        TraceCheckUtils]: 0: Hoare triple {732#unseeded} assume { :begin_inline_ULTIMATE.init } true; {732#unseeded} is VALID
[2022-02-21 03:24:45,144 INFO  L290        TraceCheckUtils]: 1: Hoare triple {732#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_~i~0#1, main_~j~0#1, main_~m~0#1, main_~n~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~m~0#1;havoc main_~n~0#1;main_~n~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~m~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {732#unseeded} is VALID
[2022-02-21 03:24:45,145 INFO  L290        TraceCheckUtils]: 2: Hoare triple {732#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := 0;main_~j~0#1 := 0; {732#unseeded} is VALID
[2022-02-21 03:24:45,152 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:45,153 INFO  L263         TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core
[2022-02-21 03:24:45,158 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2022-02-21 03:24:45,158 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2022-02-21 03:24:45,209 INFO  L290        TraceCheckUtils]: 0: Hoare triple {735#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~i~0#1 < main_~n~0#1); {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID
[2022-02-21 03:24:45,210 INFO  L290        TraceCheckUtils]: 1: Hoare triple {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume main_~j~0#1 < main_~m~0#1;main_~j~0#1 := 1 + main_~j~0#1; {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID
[2022-02-21 03:24:45,211 INFO  L290        TraceCheckUtils]: 2: Hoare triple {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume !!(main_~i~0#1 < main_~n~0#1); {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} is VALID
[2022-02-21 03:24:45,211 INFO  L290        TraceCheckUtils]: 3: Hoare triple {756#(and (< |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~n~0#1|) (>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|)))} assume !(main_~j~0#1 < main_~m~0#1);main_~j~0#1 := 0;main_~i~0#1 := 1 + main_~i~0#1; {745#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~i~0#1|) |ULTIMATE.start_main_~n~0#1|))) unseeded)} is VALID
[2022-02-21 03:24:45,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2022-02-21 03:24:45,213 INFO  L86        InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:45,218 INFO  L122       InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 
[2022-02-21 03:24:45,218 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 4 letters.
[2022-02-21 03:24:45,218 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,219 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:45,219 INFO  L71    iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:45,236 INFO  L75    iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 8 transitions. cyclomatic complexity: 2. Second operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 12 states and 15 transitions. Complement of second has 4 states.
[2022-02-21 03:24:45,237 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:45,237 INFO  L123   tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:45,237 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2
[2022-02-21 03:24:45,237 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:45,237 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:45,237 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:45,238 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:45,238 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2022-02-21 03:24:45,238 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2022-02-21 03:24:45,238 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions.
[2022-02-21 03:24:45,239 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2022-02-21 03:24:45,239 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2022-02-21 03:24:45,239 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2
[2022-02-21 03:24:45,241 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words.
[2022-02-21 03:24:45,241 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:45,241 INFO  L131   ngComponentsAnalysis]: Automaton has 1 accepting balls. 2
[2022-02-21 03:24:45,242 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words.
[2022-02-21 03:24:45,242 INFO  L70          LassoExtractor]: Start lassoExtractor. Operand 12 states and 15 transitions. cyclomatic complexity: 5
[2022-02-21 03:24:45,242 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. cyclomatic complexity: 5
[2022-02-21 03:24:45,242 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2022-02-21 03:24:45,242 INFO  L86          LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words.
[2022-02-21 03:24:45,242 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:45,242 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 4 letters.
[2022-02-21 03:24:45,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:45,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:45,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:45,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,243 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:45,243 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 7 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters.
[2022-02-21 03:24:45,244 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,244 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters.
[2022-02-21 03:24:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 4 letters.
[2022-02-21 03:24:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,245 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:45,245 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,247 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 4 letters.
[2022-02-21 03:24:45,247 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,248 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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 4 letters.
[2022-02-21 03:24:45,248 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,249 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters.
[2022-02-21 03:24:45,256 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,256 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:45,256 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,257 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states 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:45,257 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,257 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 12 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters.
[2022-02-21 03:24:45,258 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,258 INFO  L161   tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3
[2022-02-21 03:24:45,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:45,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions.
[2022-02-21 03:24:45,261 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 4 letters.
[2022-02-21 03:24:45,261 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,261 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 4 letters.
[2022-02-21 03:24:45,261 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,261 INFO  L84            BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 3 letters. Loop has 8 letters.
[2022-02-21 03:24:45,262 INFO  L116           BuchiAccepts]: Finished buchiAccepts.
[2022-02-21 03:24:45,262 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 15 transitions. cyclomatic complexity: 5
[2022-02-21 03:24:45,262 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2022-02-21 03:24:45,262 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions.
[2022-02-21 03:24:45,263 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 0
[2022-02-21 03:24:45,263 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 0
[2022-02-21 03:24:45,263 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions.
[2022-02-21 03:24:45,263 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2022-02-21 03:24:45,263 INFO  L681         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-02-21 03:24:45,263 INFO  L704         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-02-21 03:24:45,263 INFO  L587         BuchiCegarLoop]: Abstraction has 0 states and 0 transitions.
[2022-02-21 03:24:45,263 INFO  L425         BuchiCegarLoop]: ======== Iteration 5============
[2022-02-21 03:24:45,263 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions.
[2022-02-21 03:24:45,264 INFO  L131   ngComponentsAnalysis]: Automaton has 0 accepting balls. 0
[2022-02-21 03:24:45,264 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is true
[2022-02-21 03:24:45,270 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:45 BoogieIcfgContainer
[2022-02-21 03:24:45,271 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2022-02-21 03:24:45,272 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2022-02-21 03:24:45,272 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2022-02-21 03:24:45,272 INFO  L275        PluginConnector]: Witness Printer initialized
[2022-02-21 03:24:45,272 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:40" (3/4) ...
[2022-02-21 03:24:45,275 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2022-02-21 03:24:45,276 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2022-02-21 03:24:45,277 INFO  L158              Benchmark]: Toolchain (without parser) took 5234.55ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 72.1MB in the beginning and 62.9MB in the end (delta: 9.2MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB.
[2022-02-21 03:24:45,277 INFO  L158              Benchmark]: CDTParser took 0.26ms. Allocated memory is still 94.4MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB.
[2022-02-21 03:24:45,278 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 189.09ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 71.8MB in the beginning and 91.3MB in the end (delta: -19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2022-02-21 03:24:45,278 INFO  L158              Benchmark]: Boogie Procedure Inliner took 27.91ms. Allocated memory is still 115.3MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
[2022-02-21 03:24:45,278 INFO  L158              Benchmark]: Boogie Preprocessor took 17.34ms. Allocated memory is still 115.3MB. Free memory was 90.1MB in the beginning and 88.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
[2022-02-21 03:24:45,278 INFO  L158              Benchmark]: RCFGBuilder took 199.12ms. Allocated memory is still 115.3MB. Free memory was 88.9MB in the beginning and 80.5MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2022-02-21 03:24:45,279 INFO  L158              Benchmark]: BuchiAutomizer took 4791.45ms. Allocated memory is still 115.3MB. Free memory was 80.1MB in the beginning and 62.9MB in the end (delta: 17.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB.
[2022-02-21 03:24:45,279 INFO  L158              Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 115.3MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB.
[2022-02-21 03:24:45,283 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.26ms. Allocated memory is still 94.4MB. Free memory was 49.9MB in the beginning and 49.8MB in the end (delta: 83.1kB). There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 189.09ms. Allocated memory was 94.4MB in the beginning and 115.3MB in the end (delta: 21.0MB). Free memory was 71.8MB in the beginning and 91.3MB in the end (delta: -19.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 27.91ms. Allocated memory is still 115.3MB. Free memory was 91.3MB in the beginning and 90.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB.
 * Boogie Preprocessor took 17.34ms. Allocated memory is still 115.3MB. Free memory was 90.1MB in the beginning and 88.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB.
 * RCFGBuilder took 199.12ms. Allocated memory is still 115.3MB. Free memory was 88.9MB in the beginning and 80.5MB in the end (delta: 8.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
 * BuchiAutomizer took 4791.45ms. Allocated memory is still 115.3MB. Free memory was 80.1MB in the beginning and 62.9MB in the end (delta: 17.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB.
 * Witness Printer took 4.26ms. Allocated memory is still 115.3MB. Free memory is still 62.9MB. 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * j + m and consists of 4 locations. One deterministic module has affine ranking function -1 * j + m and consists of 3 locations. One deterministic module has affine ranking function -1 * i + n and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j + m and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 4.7s and 5 iterations.  TraceHistogramMax:3. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2.	Nontrivial modules had stage [3, 0, 1, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 2/2	HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 33 IncrementalHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 53 mSDtfsCounter, 33 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown	LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks:   Lassos: inital15 mio100 ax182 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf112 neg98 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 4	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 1.0s	
  - TerminationAnalysisResult: Termination proven
    Buchi Automizer proved that your program is terminating
RESULT: Ultimate proved your program to be correct!
[2022-02-21 03:24:45,322 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:45,536 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0
[2022-02-21 03:24:45,737 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE