./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.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-restricted-15/McCarthyIterative.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 faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:26:32,534 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:26:32,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:26:32,571 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:26:32,572 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:26:32,573 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:26:32,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:26:32,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:26:32,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:26:32,577 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:26:32,578 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:26:32,579 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:26:32,580 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:26:32,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:26:32,581 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:26:32,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:26:32,583 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:26:32,584 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:26:32,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:26:32,587 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:26:32,588 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:26:32,589 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:26:32,590 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:26:32,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:26:32,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:26:32,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:26:32,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:26:32,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:26:32,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:26:32,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:26:32,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:26:32,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:26:32,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:26:32,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:26:32,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:26:32,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:26:32,601 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:26:32,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:26:32,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:26:32,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:26:32,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:26:32,603 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:26:32,622 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:26:32,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:26:32,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:26:32,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:26:32,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:26:32,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:26:32,624 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:26:32,624 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:26:32,624 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:26:32,624 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:26:32,625 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:26:32,625 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:26:32,625 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:26:32,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:26:32,625 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:26:32,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:26:32,627 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:26:32,627 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:26:32,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:26:32,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:26:32,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:26:32,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:26:32,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:26:32,629 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:26:32,629 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 -> faa806fd1be90697a522dfc0988145f6572d5d87fac98caf7aa5fe5b66e6095c [2022-02-21 03:26:32,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:26:32,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:26:32,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:26:32,864 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:26:32,865 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:26:32,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2022-02-21 03:26:32,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921ed0cbe/75e4a0907f9f49f891de021caf93770e/FLAGad55d2453 [2022-02-21 03:26:33,318 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:26:33,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/McCarthyIterative.c [2022-02-21 03:26:33,327 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921ed0cbe/75e4a0907f9f49f891de021caf93770e/FLAGad55d2453 [2022-02-21 03:26:33,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921ed0cbe/75e4a0907f9f49f891de021caf93770e [2022-02-21 03:26:33,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:26:33,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:26:33,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:26:33,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:26:33,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:26:33,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@705b4fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33, skipping insertion in model container [2022-02-21 03:26:33,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:26:33,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:26:33,900 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:26:33,912 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:26:33,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:26:33,931 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:26:33,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33 WrapperNode [2022-02-21 03:26:33,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:26:33,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:26:33,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:26:33,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:26:33,938 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:26:33" (1/1) ... [2022-02-21 03:26:33,941 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:26:33" (1/1) ... [2022-02-21 03:26:33,953 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-02-21 03:26:33,954 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:26:33,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:26:33,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:26:33,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:26:33,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,961 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,969 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:26:33,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:26:33,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:26:33,970 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:26:33,973 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (1/1) ... [2022-02-21 03:26:33,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:33,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:34,003 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:26:34,013 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:26:34,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:26:34,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:26:34,078 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:26:34,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:26:34,138 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:26:34,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:26:34,144 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:26:34,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:26:34 BoogieIcfgContainer [2022-02-21 03:26:34,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:26:34,146 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:26:34,146 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:26:34,149 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:26:34,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:26:34,150 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:26:33" (1/3) ... [2022-02-21 03:26:34,151 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5044d77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:26:34, skipping insertion in model container [2022-02-21 03:26:34,151 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:26:34,151 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:26:33" (2/3) ... [2022-02-21 03:26:34,152 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5044d77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:26:34, skipping insertion in model container [2022-02-21 03:26:34,152 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:26:34,152 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:26:34" (3/3) ... [2022-02-21 03:26:34,154 INFO L388 chiAutomizerObserver]: Analyzing ICFG McCarthyIterative.c [2022-02-21 03:26:34,192 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:26:34,193 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:26:34,193 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:26:34,193 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:26:34,193 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:26:34,193 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:26:34,193 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:26:34,193 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:26:34,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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:26:34,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:34,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:34,234 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:34,238 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:26:34,239 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:26:34,239 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:26:34,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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:26:34,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:34,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:34,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:34,242 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:26:34,242 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:26:34,247 INFO L791 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 3#L12-2true [2022-02-21 03:26:34,247 INFO L793 eck$LassoCheckResult]: Loop: 3#L12-2true assume !!(main_~c~0#1 > 0); 9#L12true assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 3#L12-2true [2022-02-21 03:26:34,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:26:34,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:34,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744936024] [2022-02-21 03:26:34,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:34,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,352 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:34,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:26:34,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:34,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125548292] [2022-02-21 03:26:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,403 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:34,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:34,406 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:26:34,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:34,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934416308] [2022-02-21 03:26:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:34,433 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:34,594 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:34,595 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:34,595 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:34,595 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:34,595 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:34,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:34,596 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:34,596 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:34,596 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2022-02-21 03:26:34,596 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:34,596 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:34,627 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:26:34,643 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:26:34,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:34,665 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:26:34,799 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:34,800 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:34,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:34,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:34,803 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:26:34,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:34,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:34,816 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:26:34,835 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:26:34,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:34,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:34,840 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:26:34,844 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:26:34,853 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:34,853 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:34,897 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:34,904 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:26:34,904 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:34,904 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:34,904 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:34,905 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:34,905 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:34,905 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:34,905 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:34,905 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:34,905 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration1_Loop [2022-02-21 03:26:34,905 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:34,905 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:34,907 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:26:34,915 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:26:34,919 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:26:34,922 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:26:34,995 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:34,999 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:35,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,004 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:26:35,005 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:26:35,006 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:26:35,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:35,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:35,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:35,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:35,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:35,020 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:35,020 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:35,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:35,046 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:26:35,046 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:35,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,052 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:26:35,053 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:26:35,055 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:35,055 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:35,055 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:35,056 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2022-02-21 03:26:35,077 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:26:35,088 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:35,095 INFO L390 LassoCheck]: Loop: "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2022-02-21 03:26:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:35,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#unseeded} assume { :begin_inline_ULTIMATE.init } true; {18#unseeded} is VALID [2022-02-21 03:26:35,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {18#unseeded} is VALID [2022-02-21 03:26:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,159 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:35,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {21#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:35,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {31#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:26:35,175 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:26:35,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:35,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,214 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:26:35,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) 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 has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,276 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 8 states, 7 states have (on average 1.4285714285714286) 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 has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 31 transitions. Complement of second has 6 states. [2022-02-21 03:26:35,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:35,277 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:35,277 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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:26:35,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:35,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:35,281 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:35,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:26:35,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:35,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:35,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:26:35,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:35,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:35,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:35,295 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 8 states, 7 states have (on average 1.4285714285714286) 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:26:35,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:35,298 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:35,298 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:26:35,300 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:35,301 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:35,301 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:35,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:26:35,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:26:35,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:26:35,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:35,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:35,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:35,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:35,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:35,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:35,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:26:35,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,315 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:26:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:26:35,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,318 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,318 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:26:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,319 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:26:35,319 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:26:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,320 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:35,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:35,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:35,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:35,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 8 states, 7 states have (on average 1.4285714285714286) 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) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,338 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2022-02-21 03:26:35,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:35,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:35,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:35,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:35,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:35,362 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:35,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:26:35,367 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:26:35,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:26:35,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:26:35,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:26:35,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:35,369 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:26:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:26:35,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:26:35,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:35,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,393 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,394 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,397 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:35,398 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:26:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:26:35,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:35,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:35,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:26:35,400 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 8 states and 11 transitions. [2022-02-21 03:26:35,400 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:35,402 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:26:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:26:35,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:35,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:35,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:35,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:35,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:35,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:26:35,405 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:26:35,405 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:26:35,405 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:26:35,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:26:35,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:35,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:35,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:35,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:26:35,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:26:35,409 INFO L791 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 80#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 81#L12-2 assume !!(main_~c~0#1 > 0); 78#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 74#L12-2 [2022-02-21 03:26:35,409 INFO L793 eck$LassoCheckResult]: Loop: 74#L12-2 assume !!(main_~c~0#1 > 0); 75#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 74#L12-2 [2022-02-21 03:26:35,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:35,410 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-02-21 03:26:35,410 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:35,410 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738252633] [2022-02-21 03:26:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:35,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:35,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:35,424 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:35,435 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:35,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-02-21 03:26:35,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:35,437 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782465595] [2022-02-21 03:26:35,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:35,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:35,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:35,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:35,466 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-02-21 03:26:35,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:35,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56227190] [2022-02-21 03:26:35,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:35,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:35,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#true} assume { :begin_inline_ULTIMATE.init } true; {129#true} is VALID [2022-02-21 03:26:35,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {131#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:35,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {131#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:35,548 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {132#(<= |ULTIMATE.start_main_~c~0#1| 0)} is VALID [2022-02-21 03:26:35,548 INFO L290 TraceCheckUtils]: 4: Hoare triple {132#(<= |ULTIMATE.start_main_~c~0#1| 0)} assume !!(main_~c~0#1 > 0); {130#false} is VALID [2022-02-21 03:26:35,549 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {130#false} is VALID [2022-02-21 03:26:35,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:35,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:35,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56227190] [2022-02-21 03:26:35,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56227190] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:26:35,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:26:35,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:26:35,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419006542] [2022-02-21 03:26:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:26:35,583 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:35,583 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:35,583 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:35,583 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:35,583 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:35,583 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:35,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:35,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2022-02-21 03:26:35,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:35,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:35,585 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:26:35,588 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:26:35,592 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:26:35,597 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:26:35,661 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:35,661 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:35,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,662 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:26:35,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:35,672 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,685 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:26:35,686 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:35,686 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:26:35,701 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:26:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,703 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:26:35,703 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:26:35,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:35,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,740 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:35,740 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:35,765 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:26:35,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,767 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:26:35,767 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:26:35,769 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:35,769 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 03:26:35,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,798 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:26:35,798 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:26:35,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:35,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,823 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:35,823 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0#1=1}, {ULTIMATE.start_main_~c~0#1=0}, {ULTIMATE.start_main_~c~0#1=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2022-02-21 03:26:35,847 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:26:35,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,849 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:26:35,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:35,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,858 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:26:35,904 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:26:35,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:35,906 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:26:35,906 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:26:35,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:35,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:35,950 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:35,957 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:26:35,957 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:35,958 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:35,958 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:35,958 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:35,958 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:35,958 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:35,958 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:35,958 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:35,958 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration2_Loop [2022-02-21 03:26:35,958 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:35,958 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:35,959 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:26:35,963 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:26:35,967 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:26:35,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:36,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:36,050 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:36,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,051 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:26:36,058 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:26:36,059 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:26:36,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:36,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:36,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:36,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:36,067 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:36,068 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:36,080 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:36,104 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:26:36,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,105 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:26:36,106 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:26:36,107 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:26:36,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:36,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:36,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:36,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:36,116 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:36,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:36,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:36,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-02-21 03:26:36,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,139 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:26:36,140 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:26:36,141 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:26:36,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:36,147 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:36,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:36,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:36,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:36,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:36,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:36,151 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:36,167 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:26:36,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,168 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:26:36,169 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:26:36,172 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:26:36,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:36,177 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:36,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:36,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:36,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:36,178 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:36,179 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:36,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:36,185 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:26:36,185 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:36,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,192 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:26:36,193 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:26:36,223 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:36,224 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:36,224 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:36,224 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2022-02-21 03:26:36,249 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:26:36,258 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:36,265 INFO L390 LassoCheck]: Loop: "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2022-02-21 03:26:36,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:36,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:36,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#unseeded} assume { :begin_inline_ULTIMATE.init } true; {133#unseeded} is VALID [2022-02-21 03:26:36,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {133#unseeded} is VALID [2022-02-21 03:26:36,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#unseeded} assume !!(main_~c~0#1 > 0); {133#unseeded} is VALID [2022-02-21 03:26:36,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {133#unseeded} is VALID [2022-02-21 03:26:36,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,323 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:36,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {136#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:36,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {146#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:26:36,336 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:26:36,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,340 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:26:36,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:26:36,341 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 12 states and 17 transitions. Complement of second has 5 states. [2022-02-21 03:26:36,363 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:26:36,363 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:36,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:36,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:36,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:36,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:36,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:36,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:26:36,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:36,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:36,366 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:36,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:36,367 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,368 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:36,368 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:36,368 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:36,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,372 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:26:36,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:36,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:36,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:36,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:36,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:36,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:36,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:36,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:36,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:36,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:36,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:36,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:26:36,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:36,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:36,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:36,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:36,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:26:36,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:26:36,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:26:36,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:36,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:36,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:36,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:26:36,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:26:36,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:26:36,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:26:36,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:36,396 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:26:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:26:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:26:36,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:36,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,398 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,398 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,399 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:36,400 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:26:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:26:36,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:36,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:36,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:26:36,401 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 17 transitions. [2022-02-21 03:26:36,401 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:36,403 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:26:36,403 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:26:36,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:36,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:36,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:36,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:26:36,405 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:26:36,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:36,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:26:36,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:26:36,409 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. 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:26:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:36,431 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-21 03:26:36,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:26:36,431 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:26:36,436 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:26:36,436 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2022-02-21 03:26:36,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 17 transitions. [2022-02-21 03:26:36,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:26:36,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:26:36,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2022-02-21 03:26:36,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:36,438 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2022-02-21 03:26:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2022-02-21 03:26:36,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-02-21 03:26:36,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:36,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,439 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,440 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,440 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:36,441 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:26:36,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:26:36,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:36,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:36,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:26:36,441 INFO L87 Difference]: Start difference. First operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 17 transitions. [2022-02-21 03:26:36,442 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:36,442 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2022-02-21 03:26:36,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2022-02-21 03:26:36,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:36,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:36,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:36,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:36,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2022-02-21 03:26:36,444 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:26:36,444 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2022-02-21 03:26:36,444 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:26:36,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:26:36,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:36,444 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:36,444 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:36,445 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2022-02-21 03:26:36,445 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:26:36,445 INFO L791 eck$LassoCheckResult]: Stem: 270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 271#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 265#L12-2 assume !!(main_~c~0#1 > 0); 266#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 276#L12-2 assume !!(main_~c~0#1 > 0); 272#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 273#L12-2 assume !!(main_~c~0#1 > 0); 269#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 275#L12-2 [2022-02-21 03:26:36,446 INFO L793 eck$LassoCheckResult]: Loop: 275#L12-2 assume !!(main_~c~0#1 > 0); 274#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 275#L12-2 [2022-02-21 03:26:36,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:36,446 INFO L85 PathProgramCache]: Analyzing trace with hash 297591406, now seen corresponding path program 2 times [2022-02-21 03:26:36,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:36,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196803362] [2022-02-21 03:26:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:36,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:36,463 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:36,469 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:36,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:36,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2022-02-21 03:26:36,469 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:36,469 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109484558] [2022-02-21 03:26:36,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:36,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:36,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:36,477 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:36,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:36,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1777467309, now seen corresponding path program 3 times [2022-02-21 03:26:36,477 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:36,477 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458787316] [2022-02-21 03:26:36,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:36,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#true} assume { :begin_inline_ULTIMATE.init } true; {346#true} is VALID [2022-02-21 03:26:36,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume !!(main_~c~0#1 > 0); {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} is VALID [2022-02-21 03:26:36,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} assume !!(main_~c~0#1 > 0); {347#false} is VALID [2022-02-21 03:26:36,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {347#false} is VALID [2022-02-21 03:26:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:26:36,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:36,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458787316] [2022-02-21 03:26:36,533 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458787316] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:26:36,533 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552960157] [2022-02-21 03:26:36,533 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:26:36,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:26:36,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,535 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:26:36,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:26:36,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-21 03:26:36,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:26:36,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:36,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:36,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:36,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#true} assume { :begin_inline_ULTIMATE.init } true; {346#true} is VALID [2022-02-21 03:26:36,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume !!(main_~c~0#1 > 0); {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} is VALID [2022-02-21 03:26:36,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} assume !!(main_~c~0#1 > 0); {347#false} is VALID [2022-02-21 03:26:36,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {347#false} is VALID [2022-02-21 03:26:36,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:26:36,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:26:36,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {347#false} is VALID [2022-02-21 03:26:36,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} assume !!(main_~c~0#1 > 0); {347#false} is VALID [2022-02-21 03:26:36,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {350#(<= |ULTIMATE.start_main_~c~0#1| 0)} is VALID [2022-02-21 03:26:36,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,760 INFO L290 TraceCheckUtils]: 4: Hoare triple {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} assume !!(main_~c~0#1 > 0); {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {349#(<= |ULTIMATE.start_main_~c~0#1| 2)} is VALID [2022-02-21 03:26:36,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} assume !!(main_~c~0#1 > 0); {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {348#(<= |ULTIMATE.start_main_~c~0#1| 1)} is VALID [2022-02-21 03:26:36,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {346#true} assume { :begin_inline_ULTIMATE.init } true; {346#true} is VALID [2022-02-21 03:26:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-21 03:26:36,763 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552960157] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:26:36,763 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:26:36,763 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-02-21 03:26:36,764 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968262839] [2022-02-21 03:26:36,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:26:36,798 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:36,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:36,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:36,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:36,799 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:36,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,799 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:36,799 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:36,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2022-02-21 03:26:36,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:36,799 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:36,800 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:26:36,803 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:26:36,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:36,813 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:26:36,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:36,868 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:36,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,869 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:26:36,870 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:26:36,872 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:36,872 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:36,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:36,883 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:26:36,898 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:26:36,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,900 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:26:36,907 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:26:36,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:36,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:36,953 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:26:36,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,955 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:26:36,961 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:26:36,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:36,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:36,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:36,977 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0#1=1} Honda state: {ULTIMATE.start_main_~c~0#1=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0#1=1}, {ULTIMATE.start_main_~c~0#1=0}, {ULTIMATE.start_main_~c~0#1=0}] Lambdas: [1, 0, 0] Nus: [0, 0] [2022-02-21 03:26:36,993 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:26:36,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:36,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:36,995 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:26:36,995 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:26:36,997 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:36,997 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:37,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 03:26:37,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,023 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:26:37,023 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:26:37,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:37,027 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:37,063 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:37,071 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:26:37,072 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:37,072 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:37,072 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:37,072 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:37,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:37,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:37,073 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:37,073 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration3_Loop [2022-02-21 03:26:37,073 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:37,073 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:37,074 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:26:37,089 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:26:37,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:37,098 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:26:37,154 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:37,154 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:37,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,156 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:26:37,164 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:26:37,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:37,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:37,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:37,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:37,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:37,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:37,173 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:37,187 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:26:37,189 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:37,214 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:26:37,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,215 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:26:37,216 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:26:37,217 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:26:37,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:37,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:37,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:37,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:37,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:37,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:37,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:37,239 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:37,241 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:26:37,241 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:37,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,247 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:26:37,252 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:37,252 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:37,252 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:37,252 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 211 Supporting invariants [] [2022-02-21 03:26:37,255 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:26:37,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:37,273 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:37,279 INFO L390 LassoCheck]: Loop: "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" [2022-02-21 03:26:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#unseeded} assume { :begin_inline_ULTIMATE.init } true; {405#unseeded} is VALID [2022-02-21 03:26:37,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {405#unseeded} is VALID [2022-02-21 03:26:37,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {405#unseeded} is VALID [2022-02-21 03:26:37,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,343 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:37,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {418#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:26:37,357 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:26:37,358 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:26:37,362 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:26:37,362 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:26:37,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:26:37,363 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:26:37,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 14 states and 20 transitions. Complement of second has 5 states. [2022-02-21 03:26:37,382 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:26:37,382 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,382 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,382 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,382 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:26:37,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:26:37,385 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,386 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,387 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:37,387 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:26:37,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,388 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:37,388 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:37,389 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,389 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:26:37,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,390 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:26:37,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,391 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:26:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,391 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 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 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 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,392 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:26:37,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,393 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 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:26:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,394 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:26:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,395 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:26:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,396 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,396 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,397 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:26:37,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:26:37,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,398 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:37,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,442 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#unseeded} assume { :begin_inline_ULTIMATE.init } true; {405#unseeded} is VALID [2022-02-21 03:26:37,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {405#unseeded} is VALID [2022-02-21 03:26:37,443 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,443 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {405#unseeded} is VALID [2022-02-21 03:26:37,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,449 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:37,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {418#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:26:37,461 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:26:37,463 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:26:37,467 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:26:37,467 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:26:37,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,468 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:26:37,468 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:26:37,486 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 14 states and 20 transitions. Complement of second has 5 states. [2022-02-21 03:26:37,486 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:26:37,486 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,486 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:26:37,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,487 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:26:37,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,488 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,488 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:37,488 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:26:37,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:37,489 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:37,491 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,491 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:26:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,492 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:26:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,492 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:26:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,493 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 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:26:37,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,493 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 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 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:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 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:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 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:26:37,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,496 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:26:37,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,497 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,498 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,500 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:26:37,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:26:37,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,500 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:37,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {405#unseeded} assume { :begin_inline_ULTIMATE.init } true; {405#unseeded} is VALID [2022-02-21 03:26:37,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {405#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {405#unseeded} is VALID [2022-02-21 03:26:37,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {405#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {405#unseeded} is VALID [2022-02-21 03:26:37,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {405#unseeded} assume !!(main_~c~0#1 > 0); {405#unseeded} is VALID [2022-02-21 03:26:37,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {405#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {405#unseeded} is VALID [2022-02-21 03:26:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,546 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:37,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:37,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:37,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#(>= oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {418#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 211 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:26:37,557 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:26:37,557 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:26:37,561 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:26:37,561 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:26:37,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,562 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:26:37,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 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:26:37,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. 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 16 states and 23 transitions. Complement of second has 4 states. [2022-02-21 03:26:37,581 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:26:37,581 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,582 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:26:37,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2022-02-21 03:26:37,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:37,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,584 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:26:37,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:37,584 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:26:37,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:37,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:37,584 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 23 transitions. cyclomatic complexity: 10 [2022-02-21 03:26:37,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:37,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,585 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:26:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,585 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:26:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,586 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:26:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 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 16 letters. Loop has 16 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 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 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 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:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 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:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 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:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,590 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:26:37,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,590 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:37,590 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:26:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:26:37,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:37,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:37,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2022-02-21 03:26:37,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:37,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. cyclomatic complexity: 10 [2022-02-21 03:26:37,592 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:37,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2022-02-21 03:26:37,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:26:37,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:26:37,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2022-02-21 03:26:37,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:37,593 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2022-02-21 03:26:37,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2022-02-21 03:26:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2022-02-21 03:26:37,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:37,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,594 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,594 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,595 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:37,595 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:26:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:26:37,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:37,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:37,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:26:37,596 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 19 transitions. [2022-02-21 03:26:37,596 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:37,597 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2022-02-21 03:26:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:26:37,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:37,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:37,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:37,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:37,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2022-02-21 03:26:37,598 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:26:37,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:26:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:26:37,599 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:37,621 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2022-02-21 03:26:37,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:26:37,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:37,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2022-02-21 03:26:37,630 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:26:37,631 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 15 transitions. [2022-02-21 03:26:37,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:26:37,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:26:37,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 15 transitions. [2022-02-21 03:26:37,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:37,631 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2022-02-21 03:26:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 15 transitions. [2022-02-21 03:26:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2022-02-21 03:26:37,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:37,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 15 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,632 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 15 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,632 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,632 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:37,633 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:26:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:26:37,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:37,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:37,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 15 transitions. [2022-02-21 03:26:37,633 INFO L87 Difference]: Start difference. First operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states and 15 transitions. [2022-02-21 03:26:37,634 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:37,634 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2022-02-21 03:26:37,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2022-02-21 03:26:37,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:37,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:37,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:37,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2022-02-21 03:26:37,635 INFO L704 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:26:37,635 INFO L587 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2022-02-21 03:26:37,635 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:26:37,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2022-02-21 03:26:37,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:26:37,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:37,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:37,636 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:26:37,636 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-02-21 03:26:37,637 INFO L791 eck$LassoCheckResult]: Stem: 658#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 659#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 653#L12-2 [2022-02-21 03:26:37,637 INFO L793 eck$LassoCheckResult]: Loop: 653#L12-2 assume !!(main_~c~0#1 > 0); 654#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 662#L12-2 assume !!(main_~c~0#1 > 0); 660#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 653#L12-2 [2022-02-21 03:26:37,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,637 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:26:37,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:37,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095105908] [2022-02-21 03:26:37,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:37,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,640 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,642 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1266953, now seen corresponding path program 1 times [2022-02-21 03:26:37,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:37,643 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678670876] [2022-02-21 03:26:37,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:37,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,670 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:37,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:37,674 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:26:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash 889694155, now seen corresponding path program 4 times [2022-02-21 03:26:37,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:37,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389486835] [2022-02-21 03:26:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:37,684 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:37,733 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:37,733 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:37,733 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:37,733 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:37,733 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:37,734 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,734 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:37,734 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:37,734 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2022-02-21 03:26:37,734 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:37,734 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:37,736 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:26:37,741 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:26:37,744 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:26:37,749 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:26:37,820 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:37,820 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:37,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,828 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:26:37,829 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:26:37,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:37,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:37,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:37,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,875 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:26:37,875 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:26:37,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:37,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:37,887 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:37,902 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:26:37,902 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:37,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:37,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:37,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:37,902 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:37,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:37,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:37,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration4_Loop [2022-02-21 03:26:37,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:37,903 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:37,903 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:26:37,918 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:26:37,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:26:37,927 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:26:37,989 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:37,989 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:37,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:37,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:37,990 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:26:37,999 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:26:38,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:38,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:38,007 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:26:38,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:38,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:38,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:38,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:38,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:38,018 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:38,020 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:26:38,020 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:38,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:38,024 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:26:38,032 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:26:38,032 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:38,032 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:38,033 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:38,033 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 201 Supporting invariants [] [2022-02-21 03:26:38,049 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:26:38,056 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:38,059 INFO L390 LassoCheck]: Loop: "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume !!(main_~c~0#1 > 0);" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" [2022-02-21 03:26:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {729#unseeded} assume { :begin_inline_ULTIMATE.init } true; {729#unseeded} is VALID [2022-02-21 03:26:38,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {729#unseeded} is VALID [2022-02-21 03:26:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:38,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {753#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2022-02-21 03:26:38,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {753#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0#1 > 0); {753#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2022-02-21 03:26:38,160 INFO L290 TraceCheckUtils]: 3: Hoare triple {753#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {742#(or (and (>= oldRank0 0) (> oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:26:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:38,161 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:26:38,167 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:26:38,167 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 4 letters. [2022-02-21 03:26:38,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,167 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:26:38,168 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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:26:38,182 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. 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 21 states and 27 transitions. Complement of second has 5 states. [2022-02-21 03:26:38,183 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:26:38,183 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:38,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,183 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:26:38,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:38,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-02-21 03:26:38,186 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-02-21 03:26:38,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,187 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:38,188 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:26:38,188 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:26:38,188 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:38,189 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:38,189 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 27 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:38,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:26:38,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,192 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 4 letters. [2022-02-21 03:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,192 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 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,193 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 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,194 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 21 letters. Loop has 21 letters. [2022-02-21 03:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,195 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 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,195 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 3 letters. Loop has 3 letters. [2022-02-21 03:26:38,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,196 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 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,198 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 2 letters. [2022-02-21 03:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:26:38,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,199 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 4 letters. [2022-02-21 03:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,200 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 4 letters. [2022-02-21 03:26:38,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,201 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 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,202 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,202 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 2 letters. [2022-02-21 03:26:38,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,203 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 9 letters. Loop has 4 letters. [2022-02-21 03:26:38,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,204 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 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 27 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,204 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,206 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:26:38,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2022-02-21 03:26:38,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,207 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {729#unseeded} assume { :begin_inline_ULTIMATE.init } true; {729#unseeded} is VALID [2022-02-21 03:26:38,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {729#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {729#unseeded} is VALID [2022-02-21 03:26:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~c~0#1 > 0); {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:38,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {732#(>= oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {798#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2022-02-21 03:26:38,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {798#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume !!(main_~c~0#1 > 0); {798#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} is VALID [2022-02-21 03:26:38,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {798#(and (<= (+ (div (+ oldRank0 (- 201)) (- 2)) 11) |ULTIMATE.start_main_~x~0#1|) (<= (div (+ oldRank0 (- 201)) (- 2)) 100))} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {742#(or (and (>= oldRank0 0) (> oldRank0 (+ 201 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:26:38,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:38,290 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:26:38,296 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:26:38,296 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 4 letters. [2022-02-21 03:26:38,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,297 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:26:38,297 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 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:26:38,330 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. 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 25 states and 33 transitions. Complement of second has 7 states. [2022-02-21 03:26:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:38,330 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:38,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,337 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:26:38,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:38,338 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,338 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2022-02-21 03:26:38,339 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:38,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,340 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2022-02-21 03:26:38,340 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2022-02-21 03:26:38,340 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:26:38,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:38,341 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:38,341 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 33 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:38,343 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:38,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,344 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 4 letters. [2022-02-21 03:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,344 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 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,345 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,346 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 25 letters. Loop has 25 letters. [2022-02-21 03:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:26:38,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,347 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 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,347 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:26:38,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,348 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 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:26:38,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,349 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 2 letters. [2022-02-21 03:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,350 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 4 letters. [2022-02-21 03:26:38,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,352 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 4 letters. [2022-02-21 03:26:38,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 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 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,354 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 11 letters. Loop has 2 letters. [2022-02-21 03:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 33 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:26:38,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,354 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,354 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:26:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2022-02-21 03:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 2 letters. Loop has 8 letters. [2022-02-21 03:26:38,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:38,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:38,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 17 states and 22 transitions. [2022-02-21 03:26:38,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:26:38,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:26:38,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 22 transitions. [2022-02-21 03:26:38,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:38,357 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 22 transitions. [2022-02-21 03:26:38,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 22 transitions. [2022-02-21 03:26:38,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-02-21 03:26:38,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:38,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:38,358 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:38,359 INFO L87 Difference]: Start difference. First operand 17 states and 22 transitions. Second operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:38,359 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:38,360 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:26:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:26:38,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:38,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:38,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 03:26:38,360 INFO L87 Difference]: Start difference. First operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 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 17 states and 22 transitions. [2022-02-21 03:26:38,360 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:38,361 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-02-21 03:26:38,361 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2022-02-21 03:26:38,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:38,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:38,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:38,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2022-02-21 03:26:38,362 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:26:38,362 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2022-02-21 03:26:38,362 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:26:38,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2022-02-21 03:26:38,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:38,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,363 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2022-02-21 03:26:38,363 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:26:38,363 INFO L791 eck$LassoCheckResult]: Stem: 843#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 840#L12-2 assume !!(main_~c~0#1 > 0); 841#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 847#L12-2 assume !!(main_~c~0#1 > 0); 850#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 853#L12-2 assume !!(main_~c~0#1 > 0); 852#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 849#L12-2 assume !!(main_~c~0#1 > 0); 845#L12 [2022-02-21 03:26:38,363 INFO L793 eck$LassoCheckResult]: Loop: 845#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 846#L12-2 assume !!(main_~c~0#1 > 0); 845#L12 [2022-02-21 03:26:38,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,364 INFO L85 PathProgramCache]: Analyzing trace with hash 635458587, now seen corresponding path program 5 times [2022-02-21 03:26:38,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:38,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507296365] [2022-02-21 03:26:38,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:38,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,383 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:38,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1406, now seen corresponding path program 1 times [2022-02-21 03:26:38,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:38,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692065634] [2022-02-21 03:26:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,395 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,400 INFO L85 PathProgramCache]: Analyzing trace with hash 790346520, now seen corresponding path program 6 times [2022-02-21 03:26:38,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:38,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105642488] [2022-02-21 03:26:38,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:38,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,421 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:38,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:38,426 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:38,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:38,451 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:38,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:38,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:38,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:38,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:38,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:38,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:38,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2022-02-21 03:26:38,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:38,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:38,452 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:26:38,456 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:26:38,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:38,463 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:26:38,521 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:38,521 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:38,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:38,523 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:38,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:26:38,525 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:38,525 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:38,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:38,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:38,577 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:38,584 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:38,584 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:38,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:26:38,613 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:38,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:38,616 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:38,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:38,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:38,616 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:38,616 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:38,616 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,616 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:38,616 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:38,616 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration5_Loop [2022-02-21 03:26:38,616 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:38,616 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:38,617 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:26:38,622 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:26:38,627 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:26:38,630 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:26:38,683 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:38,684 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:38,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:38,685 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:38,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:26:38,688 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:26:38,694 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:38,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:38,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:38,695 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:38,695 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:38,695 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:38,695 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:38,704 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:38,706 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:26:38,706 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:38,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:38,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:38,707 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:38,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-02-21 03:26:38,709 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:38,709 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:38,709 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:38,709 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:26:38,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:38,731 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:38,733 INFO L390 LassoCheck]: Loop: "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume !!(main_~c~0#1 > 0);" [2022-02-21 03:26:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#unseeded} assume { :begin_inline_ULTIMATE.init } true; {942#unseeded} is VALID [2022-02-21 03:26:38,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {942#unseeded} is VALID [2022-02-21 03:26:38,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,784 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:38,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:38,785 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {942#unseeded} is VALID [2022-02-21 03:26:38,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,791 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {984#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} is VALID [2022-02-21 03:26:38,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {984#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} assume !!(main_~c~0#1 > 0); {955#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:38,832 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:26:38,833 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:26:38,837 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:26:38,838 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,838 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:26:38,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 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:26:38,848 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. 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 16 states and 21 transitions. Complement of second has 3 states. [2022-02-21 03:26:38,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:38,848 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,848 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,848 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:26:38,848 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:38,848 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:38,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:26:38,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:38,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,849 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,849 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:38,849 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:26:38,850 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:38,850 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:26:38,850 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:38,850 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:38,850 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,850 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,850 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 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 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 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:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 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 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,853 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,853 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,856 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,856 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,857 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:26:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:26:38,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,857 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:38,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#unseeded} assume { :begin_inline_ULTIMATE.init } true; {942#unseeded} is VALID [2022-02-21 03:26:38,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {942#unseeded} is VALID [2022-02-21 03:26:38,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,895 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:38,895 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:38,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {942#unseeded} is VALID [2022-02-21 03:26:38,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,903 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:38,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1036#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} is VALID [2022-02-21 03:26:38,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1036#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} assume !!(main_~c~0#1 > 0); {955#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:38,947 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:26:38,948 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:26:38,958 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:26:38,959 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,959 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:26:38,959 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 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:26:38,967 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. 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 16 states and 21 transitions. Complement of second has 3 states. [2022-02-21 03:26:38,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:38,967 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,967 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,968 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:26:38,968 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:38,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:38,968 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:26:38,969 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:26:38,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:38,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:38,969 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,969 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:38,969 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:26:38,970 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:38,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:26:38,970 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:38,970 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:38,970 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:38,970 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:38,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,971 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,971 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,972 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 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,973 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:26:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,973 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 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,974 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,975 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,976 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,976 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:38,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,977 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:38,977 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:26:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:26:38,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:38,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:38,978 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:38,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:38,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:38,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {942#unseeded} assume { :begin_inline_ULTIMATE.init } true; {942#unseeded} is VALID [2022-02-21 03:26:39,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {942#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {942#unseeded} is VALID [2022-02-21 03:26:39,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:39,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:39,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:39,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {942#unseeded} is VALID [2022-02-21 03:26:39,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:39,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {942#unseeded} is VALID [2022-02-21 03:26:39,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#unseeded} assume !!(main_~c~0#1 > 0); {942#unseeded} is VALID [2022-02-21 03:26:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,017 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,048 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1088#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} is VALID [2022-02-21 03:26:39,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {1088#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 10) oldRank0) (< 100 oldRank0))} assume !!(main_~c~0#1 > 0); {955#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:26:39,056 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:26:39,057 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:26:39,060 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:26:39,061 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,061 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:26:39,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8 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:26:39,074 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 20 transitions. cyclomatic complexity: 8. 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 25 states and 30 transitions. Complement of second has 4 states. [2022-02-21 03:26:39,074 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:26:39,074 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,075 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:26:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:39,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2022-02-21 03:26:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:26:39,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,077 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,077 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:39,077 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:26:39,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:39,077 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,078 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 30 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,078 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,078 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,079 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 1 letters. [2022-02-21 03:26:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,080 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 4 letters. [2022-02-21 03:26:39,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:26:39,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,081 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 25 letters. Loop has 25 letters. [2022-02-21 03:26:39,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 25 letters. [2022-02-21 03:26:39,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:39,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,081 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:26:39,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2022-02-21 03:26:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,082 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:26:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,083 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 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:39,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,083 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 10 letters. Loop has 2 letters. [2022-02-21 03:26:39,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 2 letters. [2022-02-21 03:26:39,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,084 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 1 letters. [2022-02-21 03:26:39,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,085 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 4 letters. [2022-02-21 03:26:39,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,085 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,085 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:26:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2022-02-21 03:26:39,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 2 letters. [2022-02-21 03:26:39,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:26:39,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-02-21 03:26:39,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 25 transitions. [2022-02-21 03:26:39,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:26:39,088 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:26:39,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2022-02-21 03:26:39,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:39,089 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2022-02-21 03:26:39,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2022-02-21 03:26:39,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 16. [2022-02-21 03:26:39,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:39,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,090 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,090 INFO L87 Difference]: Start difference. First operand 20 states and 25 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,091 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:39,091 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 03:26:39,092 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 03:26:39,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:39,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:39,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 25 transitions. [2022-02-21 03:26:39,092 INFO L87 Difference]: Start difference. First operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 20 states and 25 transitions. [2022-02-21 03:26:39,093 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:39,094 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2022-02-21 03:26:39,094 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 26 transitions. [2022-02-21 03:26:39,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:39,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:39,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:39,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2022-02-21 03:26:39,095 INFO L704 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:26:39,095 INFO L587 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2022-02-21 03:26:39,095 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:26:39,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2022-02-21 03:26:39,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:26:39,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,096 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2022-02-21 03:26:39,096 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2022-02-21 03:26:39,096 INFO L791 eck$LassoCheckResult]: Stem: 1126#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 1123#L12-2 assume !!(main_~c~0#1 > 0); 1124#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1138#L12-2 assume !!(main_~c~0#1 > 0); 1132#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1136#L12-2 assume !!(main_~c~0#1 > 0); 1135#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1131#L12-2 assume !!(main_~c~0#1 > 0); 1128#L12 [2022-02-21 03:26:39,096 INFO L793 eck$LassoCheckResult]: Loop: 1128#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1129#L12-2 assume !!(main_~c~0#1 > 0); 1133#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1134#L12-2 assume !!(main_~c~0#1 > 0); 1128#L12 [2022-02-21 03:26:39,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 635458587, now seen corresponding path program 7 times [2022-02-21 03:26:39,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:39,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350187748] [2022-02-21 03:26:39,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:39,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,105 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,110 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:39,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1351673, now seen corresponding path program 2 times [2022-02-21 03:26:39,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:39,111 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562132335] [2022-02-21 03:26:39,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:39,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,116 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:39,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,148 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:39,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,149 INFO L85 PathProgramCache]: Analyzing trace with hash -686205165, now seen corresponding path program 8 times [2022-02-21 03:26:39,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:39,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447918497] [2022-02-21 03:26:39,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:39,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:39,165 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:39,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:39,214 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:39,215 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:39,215 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:39,215 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:39,215 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:39,215 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,215 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:39,215 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:39,215 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2022-02-21 03:26:39,216 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:39,216 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:39,217 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:26:39,222 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:26:39,225 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:26:39,228 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:26:39,285 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:39,285 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:39,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:39,287 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:39,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:39,300 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:39,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-02-21 03:26:39,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:39,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:39,347 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:39,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-02-21 03:26:39,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:39,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:39,371 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:39,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:39,398 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:39,398 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:39,398 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:39,398 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:39,398 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:39,398 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,398 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:39,398 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:39,398 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration6_Loop [2022-02-21 03:26:39,398 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:39,398 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:39,399 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:26:39,406 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:26:39,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:39,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:39,471 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:39,471 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:39,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:39,473 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:39,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-02-21 03:26:39,478 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:26:39,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:39,484 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:39,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:39,484 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:39,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:39,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:39,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:39,487 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:39,490 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:26:39,490 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:39,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:39,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:39,491 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:39,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-02-21 03:26:39,493 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:39,493 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:39,493 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:39,493 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = -2*ULTIMATE.start_main_~x~0#1 + 221 Supporting invariants [] [2022-02-21 03:26:39,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-02-21 03:26:39,526 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:39,529 INFO L390 LassoCheck]: Loop: "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume !!(main_~c~0#1 > 0);" [2022-02-21 03:26:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1235#unseeded} is VALID [2022-02-21 03:26:39,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#(>= oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1277#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:39,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1277#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !!(main_~c~0#1 > 0); {1277#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:39,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1284#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:26:39,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {1284#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~c~0#1 > 0); {1248#(or (and (>= oldRank0 0) (> oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:26:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:39,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:39,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,666 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:26:39,666 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,693 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 33 transitions. Complement of second has 7 states. [2022-02-21 03:26:39,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:39,694 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,694 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,694 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,694 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:39,695 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,695 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,695 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 33 transitions. [2022-02-21 03:26:39,695 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:26:39,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,698 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,698 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,698 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,700 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:39,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,700 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 33 transitions. cyclomatic complexity: 9 [2022-02-21 03:26:39,700 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:39,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:39,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:39,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:39,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 33 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,712 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-02-21 03:26:39,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,713 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:39,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1235#unseeded} is VALID [2022-02-21 03:26:39,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,753 INFO L290 TraceCheckUtils]: 4: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,754 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,754 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#(>= oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1353#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:39,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {1353#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !!(main_~c~0#1 > 0); {1353#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:39,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {1353#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1360#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:26:39,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {1360#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~c~0#1 > 0); {1248#(or (and (>= oldRank0 0) (> oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:26:39,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:39,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:39,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,835 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:26:39,835 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,873 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 33 transitions. Complement of second has 7 states. [2022-02-21 03:26:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:39,873 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,874 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:39,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,874 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2022-02-21 03:26:39,875 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-02-21 03:26:39,875 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:39,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:39,875 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:39,875 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,876 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,876 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:39,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,876 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 33 transitions. cyclomatic complexity: 10 [2022-02-21 03:26:39,876 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:39,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:39,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:39,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 33 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:39,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,883 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:39,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:39,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-21 03:26:39,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:39,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:39,884 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:39,924 INFO L290 TraceCheckUtils]: 0: Hoare triple {1235#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1235#unseeded} is VALID [2022-02-21 03:26:39,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {1235#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1235#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1235#unseeded} is VALID [2022-02-21 03:26:39,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {1235#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1235#unseeded} is VALID [2022-02-21 03:26:39,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {1235#unseeded} assume !!(main_~c~0#1 > 0); {1235#unseeded} is VALID [2022-02-21 03:26:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:26:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:39,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:40,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {1238#(>= oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1428#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:40,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1428#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !!(main_~c~0#1 > 0); {1428#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} is VALID [2022-02-21 03:26:40,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {1428#(<= (div (+ oldRank0 (- 221)) (- 2)) (+ |ULTIMATE.start_main_~x~0#1| 10))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1435#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:26:40,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {1435#(and (<= (div (+ oldRank0 (- 221)) (- 2)) 110) (<= (+ (div (+ oldRank0 (- 221)) (- 2)) 1) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~c~0#1 > 0); {1248#(or (and (>= oldRank0 0) (> oldRank0 (+ 221 (* (- 2) |ULTIMATE.start_main_~x~0#1|)))) unseeded)} is VALID [2022-02-21 03:26:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:26:40,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:40,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:40,031 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-02-21 03:26:40,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,054 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 42 states and 53 transitions. Complement of second has 8 states. [2022-02-21 03:26:40,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:40,055 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:40,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:40,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,055 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:40,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 53 transitions. [2022-02-21 03:26:40,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:26:40,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,057 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 21 transitions. cyclomatic complexity: 8 [2022-02-21 03:26:40,057 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:40,057 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:26:40,057 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:40,058 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 53 transitions. cyclomatic complexity: 14 [2022-02-21 03:26:40,058 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:26:40,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:26:40,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 42 letters. Loop has 42 letters. [2022-02-21 03:26:40,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:40,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:26:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:26:40,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:26:40,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 21 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 53 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,066 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-02-21 03:26:40,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2022-02-21 03:26:40,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 13 letters. Loop has 4 letters. [2022-02-21 03:26:40,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 8 letters. [2022-02-21 03:26:40,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. cyclomatic complexity: 14 [2022-02-21 03:26:40,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-02-21 03:26:40,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 31 states and 40 transitions. [2022-02-21 03:26:40,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:26:40,070 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:26:40,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2022-02-21 03:26:40,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:40,070 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-02-21 03:26:40,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2022-02-21 03:26:40,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2022-02-21 03:26:40,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:40,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states and 40 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,072 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states and 40 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,072 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,073 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:40,074 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-21 03:26:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-21 03:26:40,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:40,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:40,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 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 31 states and 40 transitions. [2022-02-21 03:26:40,075 INFO L87 Difference]: Start difference. First operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 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 31 states and 40 transitions. [2022-02-21 03:26:40,075 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:40,076 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-21 03:26:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-21 03:26:40,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:40,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:40,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:40,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 25 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-02-21 03:26:40,077 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-21 03:26:40,078 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-02-21 03:26:40,078 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:26:40,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-02-21 03:26:40,078 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:26:40,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,079 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 3, 3, 1, 1] [2022-02-21 03:26:40,079 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2022-02-21 03:26:40,079 INFO L791 eck$LassoCheckResult]: Stem: 1496#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1497#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 1498#L12-2 assume !!(main_~c~0#1 > 0); 1507#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1508#L12-2 assume !!(main_~c~0#1 > 0); 1505#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1503#L12-2 assume !!(main_~c~0#1 > 0); 1502#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1492#L12-2 assume !!(main_~c~0#1 > 0); 1493#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1500#L12-2 assume !!(main_~c~0#1 > 0); 1515#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1514#L12-2 assume !!(main_~c~0#1 > 0); 1513#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1511#L12-2 assume !!(main_~c~0#1 > 0); 1512#L12 [2022-02-21 03:26:40,079 INFO L793 eck$LassoCheckResult]: Loop: 1512#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1494#L12-2 assume !!(main_~c~0#1 > 0); 1495#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1516#L12-2 assume !!(main_~c~0#1 > 0); 1501#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1500#L12-2 assume !!(main_~c~0#1 > 0); 1515#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 1514#L12-2 assume !!(main_~c~0#1 > 0); 1513#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 1511#L12-2 assume !!(main_~c~0#1 > 0); 1512#L12 [2022-02-21 03:26:40,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:40,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1981740944, now seen corresponding path program 9 times [2022-02-21 03:26:40,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:40,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612664501] [2022-02-21 03:26:40,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:40,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {1644#true} assume { :begin_inline_ULTIMATE.init } true; {1644#true} is VALID [2022-02-21 03:26:40,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {1644#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1644#true} is VALID [2022-02-21 03:26:40,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {1644#true} assume !!(main_~c~0#1 > 0); {1644#true} is VALID [2022-02-21 03:26:40,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {1644#true} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1644#true} is VALID [2022-02-21 03:26:40,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {1644#true} assume !!(main_~c~0#1 > 0); {1644#true} is VALID [2022-02-21 03:26:40,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {1644#true} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1646#(<= |ULTIMATE.start_main_~x~0#1| 111)} is VALID [2022-02-21 03:26:40,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {1646#(<= |ULTIMATE.start_main_~x~0#1| 111)} assume !!(main_~c~0#1 > 0); {1646#(<= |ULTIMATE.start_main_~x~0#1| 111)} is VALID [2022-02-21 03:26:40,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {1646#(<= |ULTIMATE.start_main_~x~0#1| 111)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1647#(<= |ULTIMATE.start_main_~x~0#1| 101)} is VALID [2022-02-21 03:26:40,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {1647#(<= |ULTIMATE.start_main_~x~0#1| 101)} assume !!(main_~c~0#1 > 0); {1647#(<= |ULTIMATE.start_main_~x~0#1| 101)} is VALID [2022-02-21 03:26:40,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {1647#(<= |ULTIMATE.start_main_~x~0#1| 101)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1648#(<= |ULTIMATE.start_main_~x~0#1| 91)} is VALID [2022-02-21 03:26:40,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {1648#(<= |ULTIMATE.start_main_~x~0#1| 91)} assume !!(main_~c~0#1 > 0); {1648#(<= |ULTIMATE.start_main_~x~0#1| 91)} is VALID [2022-02-21 03:26:40,120 INFO L290 TraceCheckUtils]: 11: Hoare triple {1648#(<= |ULTIMATE.start_main_~x~0#1| 91)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1645#false} is VALID [2022-02-21 03:26:40,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#false} assume !!(main_~c~0#1 > 0); {1645#false} is VALID [2022-02-21 03:26:40,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {1645#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1645#false} is VALID [2022-02-21 03:26:40,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {1645#false} assume !!(main_~c~0#1 > 0); {1645#false} is VALID [2022-02-21 03:26:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:40,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:40,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612664501] [2022-02-21 03:26:40,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612664501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:26:40,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:26:40,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:26:40,122 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345499986] [2022-02-21 03:26:40,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:26:40,122 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:26:40,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash 743859438, now seen corresponding path program 3 times [2022-02-21 03:26:40,123 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:40,123 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653556908] [2022-02-21 03:26:40,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:40,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:40,139 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:40,145 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:40,251 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:40,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:40,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:40,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:40,252 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:26:40,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:40,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:40,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2022-02-21 03:26:40,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:40,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:40,253 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:26:40,256 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:26:40,262 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:26:40,265 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:26:40,333 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:40,333 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:26:40,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,334 INFO L229 MonitoredProcess]: Starting monitored process 38 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:26:40,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:40,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:40,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-02-21 03:26:40,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:26:40,359 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:26:40,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-02-21 03:26:40,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,377 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-02-21 03:26:40,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:26:40,379 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:40,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:40,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,404 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-02-21 03:26:40,408 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:26:40,408 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:26:40,463 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:26:40,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:40,467 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:26:40,467 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:26:40,467 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:26:40,467 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:26:40,467 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:26:40,467 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,467 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:26:40,467 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:26:40,467 INFO L133 ssoRankerPreferences]: Filename of dumped script: McCarthyIterative.c_Iteration7_Loop [2022-02-21 03:26:40,467 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:26:40,467 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:26:40,468 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:26:40,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:26:40,473 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:26:40,477 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:26:40,549 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:26:40,550 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:26:40,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,551 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,554 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:26:40,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:40,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:40,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:40,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:40,563 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:40,563 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:40,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-02-21 03:26:40,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:40,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-02-21 03:26:40,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,598 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-02-21 03:26:40,599 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:26:40,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:40,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:40,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:40,606 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:40,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:26:40,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:26:40,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:26:40,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-02-21 03:26:40,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,655 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-02-21 03:26:40,657 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:26:40,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:26:40,663 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:26:40,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:26:40,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:26:40,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:26:40,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:26:40,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:26:40,666 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:26:40,668 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:26:40,668 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:26:40,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:26:40,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:26:40,669 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:26:40,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-02-21 03:26:40,671 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:26:40,671 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:26:40,671 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:26:40,671 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0#1) = 1*ULTIMATE.start_main_~c~0#1 Supporting invariants [] [2022-02-21 03:26:40,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-02-21 03:26:40,693 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:26:40,696 INFO L390 LassoCheck]: Loop: "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume !!(main_~c~0#1 > 0);" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume !!(main_~c~0#1 > 0);" "assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1;" "assume !!(main_~c~0#1 > 0);" "assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1;" "assume !!(main_~c~0#1 > 0);" [2022-02-21 03:26:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:40,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:40,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1651#unseeded} is VALID [2022-02-21 03:26:40,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1651#unseeded} is VALID [2022-02-21 03:26:40,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,758 INFO L290 TraceCheckUtils]: 3: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:40,759 INFO L290 TraceCheckUtils]: 4: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:40,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:40,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:40,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:40,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:40,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:26:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:40,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-02-21 03:26:40,920 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:40,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:40,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:40,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_~c~0#1 > 0); {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:40,923 INFO L290 TraceCheckUtils]: 4: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:40,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:40,924 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1730#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} is VALID [2022-02-21 03:26:40,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {1730#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} assume !!(main_~c~0#1 > 0); {1734#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-21 03:26:40,925 INFO L290 TraceCheckUtils]: 8: Hoare triple {1734#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1738#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} is VALID [2022-02-21 03:26:40,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {1738#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} assume !!(main_~c~0#1 > 0); {1664#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~c~0#1|)) unseeded)} is VALID [2022-02-21 03:26:40,926 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:40,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:40,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:26:40,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 36 transitions. Complement of second has 3 states. [2022-02-21 03:26:40,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:40,958 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:40,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:40,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,959 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:40,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:40,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-02-21 03:26:40,960 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:26:40,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:40,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:40,960 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:40,961 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:40,961 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,961 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:40,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:26:40,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:40,961 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:40,962 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 36 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:40,962 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:40,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:40,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:40,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:40,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:40,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:40,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:40,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:40,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:40,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:40,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:40,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,970 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:40,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:26:40,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:40,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:40,971 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:40,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:40,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1651#unseeded} is VALID [2022-02-21 03:26:41,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,196 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_~c~0#1 > 0); {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {1819#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1838#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} is VALID [2022-02-21 03:26:41,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {1838#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} assume !!(main_~c~0#1 > 0); {1842#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-21 03:26:41,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {1842#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1846#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} is VALID [2022-02-21 03:26:41,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1846#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} assume !!(main_~c~0#1 > 0); {1664#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~c~0#1|)) unseeded)} is VALID [2022-02-21 03:26:41,202 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:41,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,214 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:41,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:26:41,215 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,229 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 27 states and 36 transitions. Complement of second has 3 states. [2022-02-21 03:26:41,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:41,229 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,230 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:41,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:41,230 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 36 transitions. [2022-02-21 03:26:41,231 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-02-21 03:26:41,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,231 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,231 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,232 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:41,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 3 transitions. cyclomatic complexity: 2 [2022-02-21 03:26:41,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:41,232 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:26:41,232 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 36 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,233 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:41,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:41,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 27 letters. Loop has 27 letters. [2022-02-21 03:26:41,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:41,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:41,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:26:41,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 36 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,241 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2022-02-21 03:26:41,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,241 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:41,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:41,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1651#unseeded} is VALID [2022-02-21 03:26:41,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,303 INFO L290 TraceCheckUtils]: 12: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,459 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_~c~0#1 > 0); {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,460 INFO L290 TraceCheckUtils]: 4: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,460 INFO L290 TraceCheckUtils]: 5: Hoare triple {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {1927#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1946#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} is VALID [2022-02-21 03:26:41,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1946#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} assume !!(main_~c~0#1 > 0); {1950#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-21 03:26:41,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {1950#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1954#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} is VALID [2022-02-21 03:26:41,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} assume !!(main_~c~0#1 > 0); {1664#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~c~0#1|)) unseeded)} is VALID [2022-02-21 03:26:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:41,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:41,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,478 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 5 loop predicates [2022-02-21 03:26:41,478 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,508 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 61 transitions. Complement of second has 4 states. [2022-02-21 03:26:41,508 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:26:41,508 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:41,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 61 transitions. [2022-02-21 03:26:41,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 03:26:41,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:41,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:41,510 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 61 transitions. cyclomatic complexity: 21 [2022-02-21 03:26:41,510 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,516 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:26:41,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,517 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:41,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1651#unseeded} is VALID [2022-02-21 03:26:41,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,735 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_~c~0#1 > 0); {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:41,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:41,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {2053#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2072#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} is VALID [2022-02-21 03:26:41,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {2072#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} assume !!(main_~c~0#1 > 0); {2076#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-21 03:26:41,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {2076#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {2080#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} is VALID [2022-02-21 03:26:41,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {2080#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} assume !!(main_~c~0#1 > 0); {1664#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~c~0#1|)) unseeded)} is VALID [2022-02-21 03:26:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:41,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:41,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,754 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:26:41,754 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,787 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 12. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 43 states and 61 transitions. Complement of second has 4 states. [2022-02-21 03:26:41,787 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:26:41,787 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,788 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,788 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:41,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,789 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 61 transitions. [2022-02-21 03:26:41,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2022-02-21 03:26:41,789 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:41,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:41,789 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:41,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,790 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:26:41,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:41,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 43 states and 61 transitions. cyclomatic complexity: 21 [2022-02-21 03:26:41,791 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 43 letters. Loop has 43 letters. [2022-02-21 03:26:41,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:41,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:26:41,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:41,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 43 states and 61 transitions. cyclomatic complexity: 21 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,799 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:26:41,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:26:41,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:41,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:41,800 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:26:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:41,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {1651#unseeded} assume { :begin_inline_ULTIMATE.init } true; {1651#unseeded} is VALID [2022-02-21 03:26:41,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {1651#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,850 INFO L290 TraceCheckUtils]: 7: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,850 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {1651#unseeded} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {1651#unseeded} is VALID [2022-02-21 03:26:41,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {1651#unseeded} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1651#unseeded} is VALID [2022-02-21 03:26:41,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {1651#unseeded} assume !!(main_~c~0#1 > 0); {1651#unseeded} is VALID [2022-02-21 03:26:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:26:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:41,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:26:42,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:42,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:42,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:42,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume !!(main_~c~0#1 > 0); {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} is VALID [2022-02-21 03:26:42,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {1654#(>= oldRank0 |ULTIMATE.start_main_~c~0#1|)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:42,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume !!(main_~c~0#1 > 0); {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} is VALID [2022-02-21 03:26:42,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {2179#(<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0)} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {2198#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} is VALID [2022-02-21 03:26:42,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2198#(<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0)} assume !!(main_~c~0#1 > 0); {2202#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} is VALID [2022-02-21 03:26:42,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {2202#(and (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) oldRank0) (< 0 |ULTIMATE.start_main_~c~0#1|))} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {2206#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} is VALID [2022-02-21 03:26:42,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {2206#(and (<= (+ |ULTIMATE.start_main_~c~0#1| 1) oldRank0) (< 2 oldRank0))} assume !!(main_~c~0#1 > 0); {1664#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~c~0#1|)) unseeded)} is VALID [2022-02-21 03:26:42,017 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-21 03:26:42,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:42,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,028 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-02-21 03:26:42,029 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,164 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,164 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,173 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,173 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,194 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,195 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,204 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,204 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,229 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,229 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,230 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,230 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,230 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,231 WARN L278 uchiComplementFKVNwa]: big8 [2022-02-21 03:26:42,267 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 26 states and 35 transitions. cyclomatic complexity: 12 Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 719 states and 1229 transitions. Complement of second has 174 states 11 powerset states163 rank states. The highest rank that occured is 7 [2022-02-21 03:26:42,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-02-21 03:26:42,268 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceFKV [2022-02-21 03:26:42,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:42,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:42,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:42,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:26:42,269 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:42,269 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:42,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 719 states and 1229 transitions. [2022-02-21 03:26:42,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2022-02-21 03:26:42,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:42,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:42,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 26 states and 35 transitions. cyclomatic complexity: 12 [2022-02-21 03:26:42,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:26:42,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2022-02-21 03:26:42,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:26:42,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 719 states and 1229 transitions. cyclomatic complexity: 533 [2022-02-21 03:26:42,279 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:26:42,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 719 letters. Loop has 719 letters. [2022-02-21 03:26:42,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 719 letters. Loop has 719 letters. [2022-02-21 03:26:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 719 letters. Loop has 719 letters. [2022-02-21 03:26:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 26 letters. Loop has 26 letters. [2022-02-21 03:26:42,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:26:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:42,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:42,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 15 letters. Loop has 6 letters. [2022-02-21 03:26:42,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:26:42,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:26:42,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:26:42,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 23 letters. Loop has 20 letters. [2022-02-21 03:26:42,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 14 letters. [2022-02-21 03:26:42,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 14 letters. [2022-02-21 03:26:42,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 25 letters. Loop has 14 letters. [2022-02-21 03:26:42,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 14 letters. [2022-02-21 03:26:42,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 14 letters. [2022-02-21 03:26:42,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 19 letters. Loop has 14 letters. [2022-02-21 03:26:42,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:26:42,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:26:42,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 25 letters. Loop has 22 letters. [2022-02-21 03:26:42,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:26:42,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:26:42,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 19 letters. Loop has 10 letters. [2022-02-21 03:26:42,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:26:42,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:26:42,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 23 letters. Loop has 14 letters. [2022-02-21 03:26:42,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 12 letters. [2022-02-21 03:26:42,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 12 letters. [2022-02-21 03:26:42,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 17 letters. Loop has 12 letters. [2022-02-21 03:26:42,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 15 letters. Loop has 12 letters. [2022-02-21 03:26:42,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 26 states and 35 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:26:42,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:26:42,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 719 states and 1229 transitions. cyclomatic complexity: 533 Stem has 17 letters. Loop has 8 letters. [2022-02-21 03:26:42,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,311 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceFKV [2022-02-21 03:26:42,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-02-21 03:26:42,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 10 letters. [2022-02-21 03:26:42,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 25 letters. Loop has 10 letters. [2022-02-21 03:26:42,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 31 transitions. Stem has 15 letters. Loop has 20 letters. [2022-02-21 03:26:42,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:26:42,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 719 states and 1229 transitions. cyclomatic complexity: 533 [2022-02-21 03:26:42,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2022-02-21 03:26:42,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 719 states to 450 states and 747 transitions. [2022-02-21 03:26:42,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-02-21 03:26:42,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2022-02-21 03:26:42,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 450 states and 747 transitions. [2022-02-21 03:26:42,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:42,380 INFO L681 BuchiCegarLoop]: Abstraction has 450 states and 747 transitions. [2022-02-21 03:26:42,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states and 747 transitions. [2022-02-21 03:26:42,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 157. [2022-02-21 03:26:42,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:42,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states and 747 transitions. Second operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,391 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states and 747 transitions. Second operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,392 INFO L87 Difference]: Start difference. First operand 450 states and 747 transitions. Second operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,392 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:42,466 INFO L93 Difference]: Finished difference Result 992 states and 1591 transitions. [2022-02-21 03:26:42,467 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1591 transitions. [2022-02-21 03:26:42,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:42,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:42,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 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 450 states and 747 transitions. [2022-02-21 03:26:42,470 INFO L87 Difference]: Start difference. First operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 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 450 states and 747 transitions. [2022-02-21 03:26:42,471 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:42,512 INFO L93 Difference]: Finished difference Result 957 states and 1595 transitions. [2022-02-21 03:26:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1595 transitions. [2022-02-21 03:26:42,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:42,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:42,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:42,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 1.78343949044586) internal successors, (280), 156 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 280 transitions. [2022-02-21 03:26:42,518 INFO L704 BuchiCegarLoop]: Abstraction has 157 states and 280 transitions. [2022-02-21 03:26:42,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:42,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:26:42,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:26:42,519 INFO L87 Difference]: Start difference. First operand 157 states and 280 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:42,546 INFO L93 Difference]: Finished difference Result 189 states and 305 transitions. [2022-02-21 03:26:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:26:42,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:26:42,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 305 transitions. [2022-02-21 03:26:42,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-02-21 03:26:42,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 174 states and 280 transitions. [2022-02-21 03:26:42,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-02-21 03:26:42,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-02-21 03:26:42,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 174 states and 280 transitions. [2022-02-21 03:26:42,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:26:42,565 INFO L681 BuchiCegarLoop]: Abstraction has 174 states and 280 transitions. [2022-02-21 03:26:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states and 280 transitions. [2022-02-21 03:26:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2022-02-21 03:26:42,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:26:42,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states and 280 transitions. Second operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,576 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states and 280 transitions. Second operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,576 INFO L87 Difference]: Start difference. First operand 174 states and 280 transitions. Second operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,576 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:42,588 INFO L93 Difference]: Finished difference Result 440 states and 673 transitions. [2022-02-21 03:26:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 673 transitions. [2022-02-21 03:26:42,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:42,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:42,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states and 280 transitions. [2022-02-21 03:26:42,589 INFO L87 Difference]: Start difference. First operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states and 280 transitions. [2022-02-21 03:26:42,590 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:26:42,601 INFO L93 Difference]: Finished difference Result 440 states and 673 transitions. [2022-02-21 03:26:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 673 transitions. [2022-02-21 03:26:42,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:26:42,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:26:42,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:26:42,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:26:42,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 151 states have (on average 1.6754966887417218) internal successors, (253), 150 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:26:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-02-21 03:26:42,605 INFO L704 BuchiCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-02-21 03:26:42,605 INFO L587 BuchiCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-02-21 03:26:42,605 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:26:42,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 151 states and 253 transitions. [2022-02-21 03:26:42,606 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-02-21 03:26:42,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:26:42,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:26:42,606 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1] [2022-02-21 03:26:42,606 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 3, 3] [2022-02-21 03:26:42,607 INFO L791 eck$LassoCheckResult]: Stem: 5638#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5639#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~x~0#1, main_~c~0#1;havoc main_~x~0#1;havoc main_~c~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~c~0#1 := 1; 5702#L12-2 assume !!(main_~c~0#1 > 0); 5703#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 5700#L12-2 assume !!(main_~c~0#1 > 0); 5695#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 5691#L12-2 assume !!(main_~c~0#1 > 0); 5694#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 5634#L12-2 assume !!(main_~c~0#1 > 0); 5635#L12 [2022-02-21 03:26:42,607 INFO L793 eck$LassoCheckResult]: Loop: 5635#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 5722#L12-2 assume !!(main_~c~0#1 > 0); 5721#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 5719#L12-2 assume !!(main_~c~0#1 > 0); 5668#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 5726#L12-2 assume !!(main_~c~0#1 > 0); 5665#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 5653#L12-2 assume !!(main_~c~0#1 > 0); 5723#L12 assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; 5658#L12-2 assume !!(main_~c~0#1 > 0); 5659#L12 assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; 5647#L12-2 assume !!(main_~c~0#1 > 0); 5635#L12 [2022-02-21 03:26:42,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 635458587, now seen corresponding path program 10 times [2022-02-21 03:26:42,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:42,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012527465] [2022-02-21 03:26:42,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:42,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:26:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:26:42,625 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:26:42,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:26:42,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1074943081, now seen corresponding path program 4 times [2022-02-21 03:26:42,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:26:42,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504684091] [2022-02-21 03:26:42,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:26:42,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:26:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:26:42,655 INFO L290 TraceCheckUtils]: 0: Hoare triple {6818#true} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {6820#(<= 91 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:26:42,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {6820#(<= 91 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~c~0#1 > 0); {6820#(<= 91 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:26:42,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {6820#(<= 91 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {6821#(<= 102 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:26:42,656 INFO L290 TraceCheckUtils]: 3: Hoare triple {6821#(<= 102 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~c~0#1 > 0); {6821#(<= 102 |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:26:42,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {6821#(<= 102 |ULTIMATE.start_main_~x~0#1|)} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {6819#false} assume !!(main_~c~0#1 > 0); {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {6819#false} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {6819#false} assume !!(main_~c~0#1 > 0); {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {6819#false} assume main_~x~0#1 > 100;main_~x~0#1 := main_~x~0#1 - 10;main_~c~0#1 := main_~c~0#1 - 1; {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {6819#false} assume !!(main_~c~0#1 > 0); {6819#false} is VALID [2022-02-21 03:26:42,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {6819#false} assume !(main_~x~0#1 > 100);main_~x~0#1 := 11 + main_~x~0#1;main_~c~0#1 := 1 + main_~c~0#1; {6819#false} is VALID [2022-02-21 03:26:42,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {6819#false} assume !!(main_~c~0#1 > 0); {6819#false} is VALID [2022-02-21 03:26:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-21 03:26:42,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:26:42,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504684091] [2022-02-21 03:26:42,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504684091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:26:42,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:26:42,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:26:42,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868331401] [2022-02-21 03:26:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:26:42,660 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 03:26:42,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:26:42,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:26:42,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:26:42,661 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 2.0) 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:26:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:26:42,681 INFO L93 Difference]: Finished difference Result 136 states and 207 transitions. [2022-02-21 03:26:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 03:26:42,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) 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:26:42,692 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:26:42,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 136 states and 207 transitions. [2022-02-21 03:26:42,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:42,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 136 states to 0 states and 0 transitions. [2022-02-21 03:26:42,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:26:42,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:26:42,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:26:42,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:26:42,695 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:26:42,695 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:26:42,695 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:26:42,696 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 03:26:42,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:26:42,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:26:42,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:26:42,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:26:42 BoogieIcfgContainer [2022-02-21 03:26:42,702 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:26:42,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:26:42,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:26:42,702 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:26:42,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:26:34" (3/4) ... [2022-02-21 03:26:42,705 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:26:42,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:26:42,706 INFO L158 Benchmark]: Toolchain (without parser) took 8958.91ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 56.6MB in the beginning and 71.2MB in the end (delta: -14.5MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2022-02-21 03:26:42,706 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 94.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:26:42,707 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.43ms. Allocated memory is still 94.4MB. Free memory was 56.5MB in the beginning and 72.1MB in the end (delta: -15.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-21 03:26:42,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.47ms. Allocated memory is still 94.4MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:26:42,707 INFO L158 Benchmark]: Boogie Preprocessor took 13.91ms. Allocated memory is still 94.4MB. Free memory was 70.8MB in the beginning and 70.0MB in the end (delta: 795.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:26:42,707 INFO L158 Benchmark]: RCFGBuilder took 175.86ms. Allocated memory is still 94.4MB. Free memory was 69.8MB in the beginning and 61.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:26:42,708 INFO L158 Benchmark]: BuchiAutomizer took 8555.78ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 61.6MB in the beginning and 71.2MB in the end (delta: -9.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2022-02-21 03:26:42,708 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 136.3MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:26:42,709 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.20ms. Allocated memory is still 94.4MB. Free memory is still 72.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.43ms. Allocated memory is still 94.4MB. Free memory was 56.5MB in the beginning and 72.1MB in the end (delta: -15.7MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.47ms. Allocated memory is still 94.4MB. Free memory was 72.1MB in the beginning and 70.8MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 13.91ms. Allocated memory is still 94.4MB. Free memory was 70.8MB in the beginning and 70.0MB in the end (delta: 795.5kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 175.86ms. Allocated memory is still 94.4MB. Free memory was 69.8MB in the beginning and 61.9MB in the end (delta: 7.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * BuchiAutomizer took 8555.78ms. Allocated memory was 94.4MB in the beginning and 136.3MB in the end (delta: 41.9MB). Free memory was 61.6MB in the beginning and 71.2MB in the end (delta: -9.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 136.3MB. Free memory is still 71.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 11 terminating modules (4 trivial, 3 deterministic, 4 nondeterministic). One deterministic module has affine ranking function 211 + -2 * x and consists of 4 locations. One deterministic module has affine ranking function 211 + -2 * x and consists of 3 locations. One deterministic module has affine ranking function 201 + -2 * x and consists of 4 locations. One nondeterministic module has affine ranking function 211 + -2 * x and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function 221 + -2 * x and consists of 4 locations. One nondeterministic module has affine ranking function c and consists of 8 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 9 iterations. TraceHistogramMax:7. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 337 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 151 states and ocurred in iteration 7. Nontrivial modules had stage [2, 1, 3, 0, 1]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 20/24 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 160 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 104 mSDtfsCounter, 160 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT4 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax159 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp100 dnf100 smp100 tf111 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:26:42,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-21 03:26:42,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE