./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4.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-speedpldi4.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 07aee1a213388f511be96198bfb1df3a8f6aa54d1d332dfab8fc2fdcd2220999 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:38,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:38,969 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:38,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:39,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:39,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:39,002 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:39,003 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:39,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:39,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:39,006 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:39,007 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:39,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:39,008 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:39,009 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:39,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:39,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:39,012 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:39,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:39,015 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:39,017 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:39,018 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:39,019 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:39,020 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:39,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:39,023 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:39,023 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:39,024 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:39,024 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:39,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:39,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:39,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:39,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:39,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:39,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:39,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:39,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:39,030 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:39,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:39,031 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:39,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:39,038 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:39,062 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:39,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:39,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:39,068 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:39,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:39,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:39,070 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:39,071 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:39,071 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:39,071 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:39,072 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:39,072 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:39,072 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:39,072 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:39,072 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:39,073 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:39,073 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:39,073 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:39,073 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:39,073 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:39,074 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:39,074 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:39,074 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:39,074 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:39,074 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:39,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:39,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:39,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:39,076 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:39,076 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 -> 07aee1a213388f511be96198bfb1df3a8f6aa54d1d332dfab8fc2fdcd2220999 [2022-02-21 03:24:39,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:39,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:39,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:39,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:39,308 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:39,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c [2022-02-21 03:24:39,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3634dc82a/d953f538317943abb330034362b57fc7/FLAG1e30dfdc9 [2022-02-21 03:24:39,785 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:39,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c [2022-02-21 03:24:39,795 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3634dc82a/d953f538317943abb330034362b57fc7/FLAG1e30dfdc9 [2022-02-21 03:24:39,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3634dc82a/d953f538317943abb330034362b57fc7 [2022-02-21 03:24:39,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:39,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:39,819 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:39,819 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:39,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:39,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:39" (1/1) ... [2022-02-21 03:24:39,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@680c0fdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:39, skipping insertion in model container [2022-02-21 03:24:39,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:39" (1/1) ... [2022-02-21 03:24:39,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:39,847 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:39,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:39,998 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:40,029 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:40,040 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:40,042 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,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:40,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:40,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:40,044 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:40,050 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,056 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,079 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-02-21 03:24:40,080 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:40,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:40,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:40,081 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:40,092 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,093 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,094 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,095 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,098 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,103 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,104 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,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:40,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:40,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:40,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:40,106 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,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,135 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,136 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,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:40,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:40,200 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:40,201 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:40,267 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:40,272 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:40,272 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:24:40,274 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,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:40,275 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:40,275 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:40,277 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:40,278 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:40,278 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:39" (1/3) ... [2022-02-21 03:24:40,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@454d5d5a 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,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:40,279 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,279 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@454d5d5a 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,279 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:40,279 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,280 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c [2022-02-21 03:24:40,315 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:40,316 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:40,316 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:40,316 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:40,316 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:40,316 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:40,316 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:40,316 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:40,329 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,343 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,344 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,344 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,348 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:40,348 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:40,349 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:40,349 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,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:40,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:40,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:40,352 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:40,352 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:40,358 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#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_~m~0#1, main_~n~0#1;havoc main_~i~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 := main_~n~0#1; 7#L20-2true [2022-02-21 03:24:40,358 INFO L793 eck$LassoCheckResult]: Loop: 7#L20-2true assume !!(main_~i~0#1 > 0); 10#L20true assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; 7#L20-2true [2022-02-21 03:24:40,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,363 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:24:40,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772508400] [2022-02-21 03:24:40,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,462 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,478 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 1 times [2022-02-21 03:24:40,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242074281] [2022-02-21 03:24:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:40,493 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:40,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash 28693989, now seen corresponding path program 1 times [2022-02-21 03:24:40,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:40,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194302580] [2022-02-21 03:24:40,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:40,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:40,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {17#true} assume { :begin_inline_ULTIMATE.init } true; {17#true} is VALID [2022-02-21 03:24:40,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {17#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {17#true} is VALID [2022-02-21 03:24:40,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#true} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {19#(<= (+ |ULTIMATE.start_main_~m~0#1| 1) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:40,583 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#(<= (+ |ULTIMATE.start_main_~m~0#1| 1) |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {19#(<= (+ |ULTIMATE.start_main_~m~0#1| 1) |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-21 03:24:40,584 INFO L290 TraceCheckUtils]: 4: Hoare triple {19#(<= (+ |ULTIMATE.start_main_~m~0#1| 1) |ULTIMATE.start_main_~i~0#1|)} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {18#false} is VALID [2022-02-21 03:24:40,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:40,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:40,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194302580] [2022-02-21 03:24:40,592 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194302580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:40,603 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:40,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:24:40,604 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134422178] [2022-02-21 03:24:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:40,678 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:40,686 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:40,686 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:40,687 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:40,687 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:40,687 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,687 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:40,687 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:40,688 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration1_Loop [2022-02-21 03:24:40,688 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:40,688 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:40,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:40,722 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,727 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,825 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:40,826 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:40,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,830 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:40,836 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,836 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,851 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:40,856 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,857 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:40,875 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:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,877 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:40,878 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:40,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,903 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:40,904 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:40,924 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:40,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,925 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:40,927 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:40,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:40,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:40,976 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:40,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:40,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:40,979 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:40,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:40,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,010 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,034 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:41,041 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,041 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,041 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,041 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,042 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,042 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:41,042 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,042 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,042 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,042 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration1_Loop [2022-02-21 03:24:41,042 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,042 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,044 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,050 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,055 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,137 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,141 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:41,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,144 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,145 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,147 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,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:41,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:41,164 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,183 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,184 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,185 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,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,195 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:41,195 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:41,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:41,231 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,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,233 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,236 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,243 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,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:41,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:41,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:41,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:41,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:41,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:41,248 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:41,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:41,261 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:24:41,261 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:24:41,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,269 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,278 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,285 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:41,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:41,285 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:41,285 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:41,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:41,309 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:41,314 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);" "assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:24:41,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {20#unseeded} assume { :begin_inline_ULTIMATE.init } true; {20#unseeded} is VALID [2022-02-21 03:24:41,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {20#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {20#unseeded} is VALID [2022-02-21 03:24:41,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {20#unseeded} is VALID [2022-02-21 03:24:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,358 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:41,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:41,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {23#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {44#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:41,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {33#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:41,382 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,403 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,411 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,412 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,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,417 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:41,419 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,487 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 8 states. [2022-02-21 03:24:41,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:41,488 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,489 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:41,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,495 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:41,499 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:41,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-02-21 03:24:41,501 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,502 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,504 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:41,507 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,508 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:41,508 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:41,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:41,511 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:41,511 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:41,512 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:41,512 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:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,513 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,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,513 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:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,517 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:41,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,518 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:41,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,518 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:41,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,519 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:41,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,524 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:41,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,525 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:41,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,525 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:41,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,525 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:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,526 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:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,526 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:41,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,526 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:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,527 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:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,527 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 5 letters. [2022-02-21 03:24:41,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,528 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:41,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,529 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,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,529 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:41,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,529 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:41,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,530 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:41,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,530 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:41,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,531 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:41,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,531 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:41,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,531 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:41,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,532 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:41,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,533 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:41,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,533 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:41,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,534 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:41,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,542 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:41,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,543 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:41,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,543 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:41,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,543 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:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,544 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:41,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,545 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:41,549 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:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:24:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:41,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:41,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:41,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:41,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 9 states and 12 transitions. [2022-02-21 03:24:41,567 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:41,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:24:41,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:24:41,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:41,570 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:41,571 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,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:24:41,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:24:41,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:41,587 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:41,587 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:41,588 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:41,590 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,592 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:41,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,593 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:41,593 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:41,593 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:41,594 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:41,594 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:41,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:41,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:41,595 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:41,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:24:41,596 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:41,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:24:41,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:24:41,603 INFO L87 Difference]: Start difference. First operand 9 states and 12 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:41,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:41,616 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2022-02-21 03:24:41,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:24:41,616 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:41,620 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,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2022-02-21 03:24:41,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 7 states and 8 transitions. [2022-02-21 03:24:41,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:41,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:24:41,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2022-02-21 03:24:41,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:41,623 INFO L681 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2022-02-21 03:24:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-21 03:24:41,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:41,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 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:41,624 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 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:41,624 INFO L87 Difference]: Start difference. First operand 7 states and 8 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:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:41,626 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:24:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:24:41,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,627 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 7 states and 8 transitions. [2022-02-21 03:24:41,627 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 7 states and 8 transitions. [2022-02-21 03:24:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:41,627 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2022-02-21 03:24:41,628 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:24:41,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:41,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:41,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:41,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:41,628 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:41,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2022-02-21 03:24:41,629 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:41,629 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2022-02-21 03:24:41,629 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:41,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2022-02-21 03:24:41,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,629 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:41,629 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:41,630 INFO L791 eck$LassoCheckResult]: Stem: 155#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 156#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_~m~0#1, main_~n~0#1;havoc main_~i~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; 153#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; 154#L20-2 assume !!(main_~i~0#1 > 0); 159#L20 assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; 157#L20-2 [2022-02-21 03:24:41,630 INFO L793 eck$LassoCheckResult]: Loop: 157#L20-2 assume !!(main_~i~0#1 > 0); 158#L20 assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; 157#L20-2 [2022-02-21 03:24:41,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,630 INFO L85 PathProgramCache]: Analyzing trace with hash 28693991, now seen corresponding path program 1 times [2022-02-21 03:24:41,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355907173] [2022-02-21 03:24:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 2 times [2022-02-21 03:24:41,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359800544] [2022-02-21 03:24:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,652 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1805122026, now seen corresponding path program 1 times [2022-02-21 03:24:41,656 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,656 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366002638] [2022-02-21 03:24:41,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,693 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,694 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,694 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,694 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,694 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:41,694 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,694 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,694 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,694 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration2_Loop [2022-02-21 03:24:41,695 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,695 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,696 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,699 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,705 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,753 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,753 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:41,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,756 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,765 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,778 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,788 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:41,788 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:41,810 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,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,812 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,824 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:41,825 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,834 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,869 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:41,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,871 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:41,876 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:41,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:41,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:41,911 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:41,914 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:41,914 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:41,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:41,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:41,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:41,915 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:41,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:41,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:41,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration2_Loop [2022-02-21 03:24:41,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:41,915 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:41,916 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,923 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,931 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,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:41,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:41,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,992 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:41,993 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:41,995 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,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,007 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,007 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,047 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,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,048 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,058 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,062 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,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,099 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:42,099 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:42,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,100 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,101 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,102 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,102 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,102 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,102 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:42,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,128 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);" "assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:24:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {183#unseeded} assume { :begin_inline_ULTIMATE.init } true; {183#unseeded} is VALID [2022-02-21 03:24:42,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {183#unseeded} is VALID [2022-02-21 03:24:42,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {183#unseeded} is VALID [2022-02-21 03:24:42,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {183#unseeded} assume !!(main_~i~0#1 > 0); {183#unseeded} is VALID [2022-02-21 03:24:42,173 INFO L290 TraceCheckUtils]: 4: Hoare triple {183#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {183#unseeded} is VALID [2022-02-21 03:24:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,181 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,213 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {213#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {196#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:42,214 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,215 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:42,219 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:42,219 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:42,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,220 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:42,220 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:42,240 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 11 states and 14 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,240 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:42,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,241 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:42,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,242 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 8 transitions. cyclomatic complexity: 2 [2022-02-21 03:24:42,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,243 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:42,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,244 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,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 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,246 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:42,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,246 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:42,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,247 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:42,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,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 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,248 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:42,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,249 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:42,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:24:42,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,249 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:42,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,249 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:42,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,250 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:42,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,251 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:42,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,252 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:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,252 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:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,253 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:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 8 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,254 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:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,254 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,255 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:42,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:42,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 03:24:42,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:42,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:42,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:42,258 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:24:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-02-21 03:24:42,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:42,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,259 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,260 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,260 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,261 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:24:42,261 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:24:42,262 INFO L87 Difference]: Start difference. First operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 14 transitions. [2022-02-21 03:24:42,262 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,263 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2022-02-21 03:24:42,263 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,263 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:42,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2022-02-21 03:24:42,264 INFO L704 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:24:42,264 INFO L587 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2022-02-21 03:24:42,265 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:42,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2022-02-21 03:24:42,265 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,265 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,265 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2022-02-21 03:24:42,266 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:42,266 INFO L791 eck$LassoCheckResult]: Stem: 237#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 238#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_~m~0#1, main_~n~0#1;havoc main_~i~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; 235#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; 236#L20-2 assume !!(main_~i~0#1 > 0); 245#L20 assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; 244#L20-2 assume !!(main_~i~0#1 > 0); 243#L20 assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; 239#L20-2 [2022-02-21 03:24:42,266 INFO L793 eck$LassoCheckResult]: Loop: 239#L20-2 assume !!(main_~i~0#1 > 0); 240#L20 assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; 239#L20-2 [2022-02-21 03:24:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1805122028, now seen corresponding path program 2 times [2022-02-21 03:24:42,267 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,267 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837397169] [2022-02-21 03:24:42,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,275 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,280 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 3 times [2022-02-21 03:24:42,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313492261] [2022-02-21 03:24:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,285 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,287 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,288 INFO L85 PathProgramCache]: Analyzing trace with hash -444518225, now seen corresponding path program 2 times [2022-02-21 03:24:42,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825872878] [2022-02-21 03:24:42,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,297 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,310 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,330 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,330 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,330 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,330 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,330 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:42,331 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,331 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,331 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,331 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration3_Loop [2022-02-21 03:24:42,331 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,331 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,332 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,334 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,340 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,384 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,385 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:42,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,386 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,398 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,398 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,404 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,420 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,420 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,443 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,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,445 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,453 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,453 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,480 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,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,524 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,525 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,526 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,526 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,559 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:42,562 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,562 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,563 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,563 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:42,563 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration3_Loop [2022-02-21 03:24:42,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,564 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,570 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,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,628 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,629 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:42,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,630 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,653 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,654 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,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,667 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,669 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,679 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,688 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,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:24:42,693 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:42,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,694 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,696 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,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,696 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,696 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,696 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-02-21 03:24:42,712 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,719 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,721 INFO L390 LassoCheck]: Loop: "assume !!(main_~i~0#1 > 0);" "assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1;" [2022-02-21 03:24:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,767 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#unseeded} assume { :begin_inline_ULTIMATE.init } true; {313#unseeded} is VALID [2022-02-21 03:24:42,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {313#unseeded} is VALID [2022-02-21 03:24:42,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,768 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,769 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,776 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {349#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {349#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {326#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:42,797 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,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,802 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:42,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,803 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:42,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,819 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 13 states and 18 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,820 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,821 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:42,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,822 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,822 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,822 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,823 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,823 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,823 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,823 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,824 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:42,824 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,833 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:42,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,834 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#unseeded} assume { :begin_inline_ULTIMATE.init } true; {313#unseeded} is VALID [2022-02-21 03:24:42,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {313#unseeded} is VALID [2022-02-21 03:24:42,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,865 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,870 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {395#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {395#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {326#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:42,890 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,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,895 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:42,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,895 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:42,895 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,910 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 13 states and 18 transitions. Complement of second has 5 states. [2022-02-21 03:24:42,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,910 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:42,912 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:42,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,913 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,915 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:42,915 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 7 [2022-02-21 03:24:42,916 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:42,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,926 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:42,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,929 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,963 INFO L290 TraceCheckUtils]: 0: Hoare triple {313#unseeded} assume { :begin_inline_ULTIMATE.init } true; {313#unseeded} is VALID [2022-02-21 03:24:42,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {313#unseeded} is VALID [2022-02-21 03:24:42,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#unseeded} assume !!(main_~i~0#1 > 0); {313#unseeded} is VALID [2022-02-21 03:24:42,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#unseeded} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {313#unseeded} is VALID [2022-02-21 03:24:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,969 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {316#(>= oldRank0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 > 0); {441#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-21 03:24:42,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {441#(and (< 0 |ULTIMATE.start_main_~i~0#1|) (>= oldRank0 |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 < main_~m~0#1;main_~i~0#1 := main_~i~0#1 - 1; {326#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-21 03:24:42,990 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,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:42,995 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:42,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:42,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,996 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 2 loop predicates [2022-02-21 03:24:42,996 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:43,021 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Result 15 states and 21 transitions. Complement of second has 4 states. [2022-02-21 03:24:43,022 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,022 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:43,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 21 transitions. [2022-02-21 03:24:43,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:43,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,026 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,026 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:43,026 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:43,027 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,027 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:43,027 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:24:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:43,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2022-02-21 03:24:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 21 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,036 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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:43,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:24:43,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:24:43,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2022-02-21 03:24:43,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:43,042 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:43,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 17 transitions. [2022-02-21 03:24:43,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:24:43,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:43,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:24:43,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,043 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:24:43,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:24:43,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 8. [2022-02-21 03:24:43,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 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:43,045 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 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:43,045 INFO L87 Difference]: Start difference. First operand 13 states and 17 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:43,051 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,051 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:24:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:24:43,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,052 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 13 states and 17 transitions. [2022-02-21 03:24:43,052 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 13 states and 17 transitions. [2022-02-21 03:24:43,053 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,053 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:24:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:24:43,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,054 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:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:24:43,055 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,055 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,055 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:43,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:24:43,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:24:43,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,056 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:43,056 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:43,056 INFO L791 eck$LassoCheckResult]: Stem: 468#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 469#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_~m~0#1, main_~n~0#1;havoc main_~i~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; 466#L17 assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; 467#L20-2 assume !!(main_~i~0#1 > 0); 470#L20 [2022-02-21 03:24:43,056 INFO L793 eck$LassoCheckResult]: Loop: 470#L20 assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; 473#L20-2 assume !!(main_~i~0#1 > 0); 470#L20 [2022-02-21 03:24:43,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,057 INFO L85 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2022-02-21 03:24:43,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276555613] [2022-02-21 03:24:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,071 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,096 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1564, now seen corresponding path program 1 times [2022-02-21 03:24:43,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93671893] [2022-02-21 03:24:43,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,101 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,103 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,103 INFO L85 PathProgramCache]: Analyzing trace with hash 889513735, now seen corresponding path program 3 times [2022-02-21 03:24:43,104 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,104 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191403090] [2022-02-21 03:24:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,111 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,115 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,156 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,156 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:43,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration4_Lasso [2022-02-21 03:24:43,156 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,157 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,169 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,171 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,181 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,184 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,186 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,267 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,267 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:43,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,272 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:43,282 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,282 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,283 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:43,301 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,302 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:43,317 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,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,320 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:43,323 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,323 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1#1=0} Honda state: {ULTIMATE.start_main_#t~nondet1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:43,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,347 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,348 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,349 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,349 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,379 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,380 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,381 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:43,381 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,490 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:43,494 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,495 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,495 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:43,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,495 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4.c_Iteration4_Lasso [2022-02-21 03:24:43,495 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,495 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,496 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,499 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,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,503 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,510 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,512 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,598 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:43,604 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,604 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:43,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,606 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,608 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,608 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,615 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,615 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,617 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,617 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,671 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,675 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,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:43,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,685 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:43,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:43,686 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,695 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:24:43,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,712 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:43,713 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:43,715 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,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,721 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:43,721 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,722 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:43,722 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:43,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:24:43,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,740 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:43,741 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:43,743 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,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,750 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,750 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,750 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,752 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,753 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,765 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:43,771 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-02-21 03:24:43,772 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-02-21 03:24:43,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,780 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:43,782 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:43,782 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:43,811 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2022-02-21 03:24:43,811 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:43,812 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~m~0#1) = 1*ULTIMATE.start_main_~i~0#1 - 1*ULTIMATE.start_main_~m~0#1 Supporting invariants [1*ULTIMATE.start_main_~m~0#1 - 1 >= 0] [2022-02-21 03:24:43,835 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:43,844 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-02-21 03:24:43,852 INFO L390 LassoCheck]: Loop: "assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1;" "assume !!(main_~i~0#1 > 0);" [2022-02-21 03:24:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,902 INFO L290 TraceCheckUtils]: 0: Hoare triple {544#unseeded} assume { :begin_inline_ULTIMATE.init } true; {544#unseeded} is VALID [2022-02-21 03:24:43,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {544#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_~m~0#1, main_~n~0#1;havoc main_~i~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; {544#unseeded} is VALID [2022-02-21 03:24:43,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {544#unseeded} assume main_~m~0#1 > 0 && main_~n~0#1 > main_~m~0#1;main_~i~0#1 := main_~n~0#1; {563#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:43,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {563#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !!(main_~i~0#1 > 0); {563#(and unseeded (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,907 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {564#(and (>= oldRank0 (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_main_~m~0#1|))) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} assume !(main_~i~0#1 < main_~m~0#1);main_~i~0#1 := main_~i~0#1 - main_~m~0#1; {581#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} is VALID [2022-02-21 03:24:43,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#(and (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0) (<= |ULTIMATE.start_main_~i~0#1| oldRank0))} assume !!(main_~i~0#1 > 0); {566#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~i~0#1| (* (- 1) |ULTIMATE.start_main_~m~0#1|))))) (>= (+ (- 1) |ULTIMATE.start_main_~m~0#1|) 0))} is VALID [2022-02-21 03:24:43,957 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,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:43,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:43,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,963 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-02-21 03:24:43,963 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,996 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:24:43,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:43,996 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:43,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2022-02-21 03:24:43,998 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:43,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:43,998 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:43,998 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:43,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,999 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:44,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,000 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,000 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,001 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:44,001 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:24:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:44,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:44,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 17 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:44,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,006 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:24:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:44,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:44,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2022-02-21 03:24:44,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:44,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:44,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:44,009 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,009 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,009 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:44,009 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:44,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:44,009 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:44,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:44,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:44 BoogieIcfgContainer [2022-02-21 03:24:44,015 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:44,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:44,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:44,016 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:44,017 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:44,019 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:44,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:44,020 INFO L158 Benchmark]: Toolchain (without parser) took 4203.74ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 64.1MB in the beginning and 70.2MB in the end (delta: -6.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,020 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,020 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.71ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 73.4MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.42ms. Allocated memory is still 96.5MB. Free memory was 73.4MB in the beginning and 72.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,021 INFO L158 Benchmark]: Boogie Preprocessor took 24.23ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 71.2MB in the end (delta: 962.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,021 INFO L158 Benchmark]: RCFGBuilder took 168.47ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 62.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,022 INFO L158 Benchmark]: BuchiAutomizer took 3741.01ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 62.6MB in the beginning and 70.2MB in the end (delta: -7.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:44,022 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 119.5MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:44,024 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 75.5MB. Free memory was 38.8MB in the beginning and 38.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 223.71ms. Allocated memory is still 96.5MB. Free memory was 63.9MB in the beginning and 73.4MB in the end (delta: -9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.42ms. Allocated memory is still 96.5MB. Free memory was 73.4MB in the beginning and 72.2MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 24.23ms. Allocated memory is still 96.5MB. Free memory was 72.2MB in the beginning and 71.2MB in the end (delta: 962.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 168.47ms. Allocated memory is still 96.5MB. Free memory was 71.2MB in the beginning and 62.9MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3741.01ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 62.6MB in the beginning and 70.2MB in the end (delta: -7.6MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 119.5MB. Free memory is still 70.2MB. 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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function i + -1 * m and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 39 mSDtfsCounter, 48 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax185 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf108 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:44,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-02-21 03:24:44,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE