./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.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 7fe3843d41a84d22889162aaa1c2b6d18f44faeeac702eea9c45f49a2c72d4bd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:09,470 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:09,472 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:09,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:09,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:09,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:09,506 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:09,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:09,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:09,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:09,516 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:09,517 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:09,518 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:09,520 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:09,521 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:09,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:09,523 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:09,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:09,527 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:09,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:09,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:09,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:09,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:09,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:09,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:09,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:09,536 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:09,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:09,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:09,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:09,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:09,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:09,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:09,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:09,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:09,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:09,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:09,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:09,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:09,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:09,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:09,545 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:25:09,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:09,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:09,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:09,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:09,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:09,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:09,575 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:09,576 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:09,576 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:09,576 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:09,576 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:09,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:09,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:09,578 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:09,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:09,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:09,579 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:09,579 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:09,580 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:09,580 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 -> 7fe3843d41a84d22889162aaa1c2b6d18f44faeeac702eea9c45f49a2c72d4bd [2022-02-21 03:25:09,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:09,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:09,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:09,789 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:09,789 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:09,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:25:09,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea19edf29/1f6c8d27f22649a7a9b7e83fe7e19029/FLAG1012f00de [2022-02-21 03:25:10,158 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:10,159 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:25:10,171 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea19edf29/1f6c8d27f22649a7a9b7e83fe7e19029/FLAG1012f00de [2022-02-21 03:25:10,598 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea19edf29/1f6c8d27f22649a7a9b7e83fe7e19029 [2022-02-21 03:25:10,600 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:10,601 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:10,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:10,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:10,607 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:10,608 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,610 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39df5ad0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10, skipping insertion in model container [2022-02-21 03:25:10,610 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:10,626 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:10,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:10,769 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:10,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:10,802 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:10,803 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10 WrapperNode [2022-02-21 03:25:10,803 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:10,804 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:10,804 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:10,804 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:10,815 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:25:10" (1/1) ... [2022-02-21 03:25:10,820 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:25:10" (1/1) ... [2022-02-21 03:25:10,844 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-21 03:25:10,845 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:10,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:10,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:10,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:10,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,859 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:10,866 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:10,866 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:10,866 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:10,867 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,891 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:25:10,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:10,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:10,927 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:25:10,992 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:10,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:11,078 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:11,085 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:11,085 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:25:11,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:11 BoogieIcfgContainer [2022-02-21 03:25:11,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:11,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:11,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:11,090 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:11,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:11,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:10" (1/3) ... [2022-02-21 03:25:11,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37d0a7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:11, skipping insertion in model container [2022-02-21 03:25:11,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:11,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (2/3) ... [2022-02-21 03:25:11,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37d0a7d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:11, skipping insertion in model container [2022-02-21 03:25:11,092 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:11,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:11" (3/3) ... [2022-02-21 03:25:11,093 INFO L388 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig4.c [2022-02-21 03:25:11,142 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:11,143 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:11,143 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:11,143 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:11,143 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:11,143 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:11,143 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:11,144 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:11,156 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:25:11,175 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:11,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,178 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:11,179 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:25:11,179 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:11,179 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:25:11,181 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:11,182 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,182 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,182 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:11,182 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:25:11,187 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 7#L18-2true [2022-02-21 03:25:11,188 INFO L793 eck$LassoCheckResult]: Loop: 7#L18-2true assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 5#L18true assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; 7#L18-2true [2022-02-21 03:25:11,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,193 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:25:11,199 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545157505] [2022-02-21 03:25:11,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,260 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,278 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 1 times [2022-02-21 03:25:11,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449560465] [2022-02-21 03:25:11,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,306 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,307 INFO L85 PathProgramCache]: Analyzing trace with hash 925800, now seen corresponding path program 1 times [2022-02-21 03:25:11,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673557067] [2022-02-21 03:25:11,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,318 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,325 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,415 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,415 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,416 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,416 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:11,416 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,416 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,416 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,416 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration1_Loop [2022-02-21 03:25:11,416 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,417 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,438 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:25:11,441 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:25:11,447 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:25:11,515 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:11,516 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:11,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,519 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:25:11,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,549 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:25:11,565 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,565 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:11,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:25:11,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,583 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:25:11,584 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:25:11,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,600 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:11,616 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:25:11,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,617 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:25:11,631 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:25:11,643 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,644 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,651 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,651 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=0} Honda state: {ULTIMATE.start_main_#t~nondet2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:11,669 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:25:11,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,684 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:25:11,686 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:25:11,687 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,699 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,737 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:25:11,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,739 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:25:11,740 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:25:11,741 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:11,741 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,767 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:11,769 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:25:11,769 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,770 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:11,770 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,770 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,770 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,770 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration1_Loop [2022-02-21 03:25:11,770 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,770 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,779 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:25:11,782 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:25:11,789 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:25:11,864 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:11,867 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:11,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,870 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:25:11,871 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:25:11,872 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:25:11,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:11,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:11,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:11,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:11,881 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:11,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:11,899 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:11,931 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:25:11,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,933 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:25:11,937 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:25:11,940 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:25:11,949 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:11,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:11,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:11,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:11,950 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:11,950 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:11,950 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:11,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:11,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:11,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,986 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:25:11,988 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:25:11,988 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:25:11,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:11,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:11,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:11,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:11,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:11,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,031 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:25:12,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,032 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:25:12,033 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:25:12,034 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:25:12,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,040 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:12,040 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,040 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,040 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,041 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:12,041 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:12,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:12,059 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:12,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:12,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,062 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:25:12,063 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:25:12,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:12,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:12,064 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:12,065 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:12,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-02-21 03:25:12,094 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:12,099 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);" "assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1;" [2022-02-21 03:25:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,130 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {18#unseeded} assume { :begin_inline_ULTIMATE.init } true; {18#unseeded} is VALID [2022-02-21 03:25:12,147 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_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {18#unseeded} is VALID [2022-02-21 03:25:12,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,152 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {39#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:25:12,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; {31#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:25:12,179 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:25:12,197 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:25:12,202 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:25:12,203 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:25:12,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,207 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:25:12,208 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:25:12,270 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 8 states. [2022-02-21 03:25:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:12,270 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,270 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:25:12,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:12,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,272 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:25:12,273 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:12,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2022-02-21 03:25:12,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:12,274 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,274 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,276 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:25:12,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:12,277 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:12,277 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:25:12,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:12,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:12,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:12,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:12,278 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:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 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:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 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:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 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:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,282 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:25:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,282 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:25:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,283 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:25:12,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,284 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:25:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,284 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:25:12,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,285 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:25:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,285 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:25:12,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,286 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:25:12,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,287 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:25:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,287 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:25:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,287 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:25:12,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,287 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 5 letters. [2022-02-21 03:25:12,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,288 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 5 letters. [2022-02-21 03:25:12,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 31 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,290 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:25:12,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,290 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:25:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,291 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:25:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,291 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:25:12,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,291 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:25:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,292 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:25:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,292 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:25:12,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,293 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:25:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,293 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:25:12,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,294 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:25:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,294 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:25:12,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,295 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:25:12,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,295 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:25:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,296 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:25:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,296 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:25:12,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,296 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:25:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,297 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:25:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,297 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:25:12,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,297 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,302 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:25:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2022-02-21 03:25:12,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:25:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:25:12,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:12,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:12,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:25:12,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2022-02-21 03:25:12,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:25:12,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:25:12,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:12,319 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:25:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:25:12,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-21 03:25:12,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:12,336 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:25:12,336 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:25:12,338 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:25:12,340 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:12,341 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:25:12,342 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:25:12,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:12,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:12,342 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:25:12,343 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:25:12,343 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:12,344 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:25:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:25:12,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:12,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:12,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:12,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:12,345 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:25:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2022-02-21 03:25:12,348 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:25:12,348 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:25:12,348 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:12,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:25:12,350 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:12,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,352 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:25:12,352 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:25:12,353 INFO L791 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 83#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 85#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 78#L18 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 79#L18-2 [2022-02-21 03:25:12,353 INFO L793 eck$LassoCheckResult]: Loop: 79#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 84#L18 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; 79#L18-2 [2022-02-21 03:25:12,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,354 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 1 times [2022-02-21 03:25:12,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295193052] [2022-02-21 03:25:12,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,368 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,375 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:12,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 2 times [2022-02-21 03:25:12,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,377 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402639759] [2022-02-21 03:25:12,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,392 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:12,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,392 INFO L85 PathProgramCache]: Analyzing trace with hash 889692235, now seen corresponding path program 1 times [2022-02-21 03:25:12,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949547803] [2022-02-21 03:25:12,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,420 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:12,448 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:12,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:12,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:12,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:12,448 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:12,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:12,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:12,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration2_Loop [2022-02-21 03:25:12,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:12,449 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:12,450 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:25:12,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:25:12,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,458 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:25:12,464 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:25:12,517 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,517 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:12,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,519 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:25:12,521 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:25:12,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,544 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:12,544 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:25:12,569 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:25:12,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,571 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:25:12,572 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:25:12,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,595 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:12,595 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:25:12,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:12,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,613 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:25:12,614 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:25:12,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,637 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:12,637 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=1} Honda state: {ULTIMATE.start_main_~x~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:12,655 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:25:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,656 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:25:12,658 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:25:12,659 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,659 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,698 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:25:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,699 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:25:12,700 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:25:12,702 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:12,702 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,732 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:12,737 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:25:12,737 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:12,737 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:12,737 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:12,737 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:12,737 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:12,738 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,738 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:12,738 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:12,738 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration2_Loop [2022-02-21 03:25:12,738 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:12,738 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:12,738 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:25:12,742 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:25:12,745 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:25:12,748 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:25:12,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:25:12,843 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,843 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:12,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,852 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:25:12,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:25:12,854 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:25:12,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,860 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,863 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,863 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:12,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,908 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:25:12,909 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:25:12,910 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:25:12,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,917 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,917 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 03:25:12,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,949 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:25:12,951 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:25:12,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:12,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,957 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:12,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:12,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,971 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:25:12,987 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:25:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,989 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:25:12,998 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:25:13,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:13,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:13,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:13,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:13,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:13,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:13,005 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:13,011 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:25:13,027 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:13,029 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:13,030 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:13,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,031 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:25:13,066 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:25:13,066 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:13,066 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:13,066 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:13,066 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:13,081 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:25:13,098 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:13,102 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);" "assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1;" [2022-02-21 03:25:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#unseeded} assume { :begin_inline_ULTIMATE.init } true; {135#unseeded} is VALID [2022-02-21 03:25:13,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {135#unseeded} is VALID [2022-02-21 03:25:13,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {135#unseeded} is VALID [2022-02-21 03:25:13,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {135#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {135#unseeded} is VALID [2022-02-21 03:25:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,153 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,172 INFO L290 TraceCheckUtils]: 0: Hoare triple {138#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {162#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:25:13,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; {148#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:25:13,173 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:25:13,174 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:25:13,177 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:25:13,177 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:25:13,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,178 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:25:13,178 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:25:13,194 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:25:13,194 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:25:13,195 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:13,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,195 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:25:13,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,196 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,197 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:13,197 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:13,197 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:25:13,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:13,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:13,198 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:25:13,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,198 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:25:13,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,199 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:25:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,199 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:25:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,199 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:25:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,199 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:25:13,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,199 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:25:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,200 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:25:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,200 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:25:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,200 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:25:13,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,200 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:25:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,201 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:25:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,201 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:25:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,201 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:25:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,201 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:25:13,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,201 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:25:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,202 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:25:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,202 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:25:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,202 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:25:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,202 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:25:13,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,203 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:25:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,203 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:25:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,203 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:25:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,203 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:25:13,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,203 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:25:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,204 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:25:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,204 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:25:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,204 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:25:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,204 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:25:13,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,205 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:25:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,205 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:25:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,205 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:25:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,205 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:25:13,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,205 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,206 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:25:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:25:13,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:25:13,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:25:13,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:13,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:25:13,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2022-02-21 03:25:13,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:25:13,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:13,209 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:25:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-21 03:25:13,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:13,210 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:25:13,210 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:25:13,210 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:25:13,210 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:13,211 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:25:13,211 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:13,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:13,211 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:25:13,211 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:25:13,212 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:13,212 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2022-02-21 03:25:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:13,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:13,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:13,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:13,213 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:25:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2022-02-21 03:25:13,214 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:25:13,214 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2022-02-21 03:25:13,214 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:13,214 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2022-02-21 03:25:13,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,214 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2022-02-21 03:25:13,215 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:25:13,215 INFO L791 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 193#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 185#L18 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 186#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 194#L18 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 191#L18-2 [2022-02-21 03:25:13,215 INFO L793 eck$LassoCheckResult]: Loop: 191#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 192#L18 assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; 191#L18-2 [2022-02-21 03:25:13,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,215 INFO L85 PathProgramCache]: Analyzing trace with hash 889692233, now seen corresponding path program 2 times [2022-02-21 03:25:13,215 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:13,216 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642645753] [2022-02-21 03:25:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:13,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,221 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,224 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1318, now seen corresponding path program 3 times [2022-02-21 03:25:13,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:13,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094012101] [2022-02-21 03:25:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,234 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:13,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,235 INFO L85 PathProgramCache]: Analyzing trace with hash 295744366, now seen corresponding path program 2 times [2022-02-21 03:25:13,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:13,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062255871] [2022-02-21 03:25:13,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:13,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,247 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:13,251 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:13,271 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:13,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:13,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:13,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:13,272 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:13,272 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:13,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:13,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration3_Loop [2022-02-21 03:25:13,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:13,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:13,273 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:25:13,276 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:25:13,278 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:25:13,281 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:25:13,284 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:25:13,344 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:13,345 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:13,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,346 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:25:13,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:13,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:13,363 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:25:13,368 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:13,368 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0#1=1} Honda state: {ULTIMATE.start_main_~x~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:13,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 03:25:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,385 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:25:13,385 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:25:13,387 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:13,387 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:13,398 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:13,398 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:25:13,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:25:13,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,414 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:25:13,415 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:25:13,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:13,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:13,423 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:13,423 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=0} Honda state: {ULTIMATE.start_main_#t~nondet2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:13,438 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:25:13,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,439 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:25:13,440 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:25:13,441 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:13,441 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:13,478 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:25:13,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,480 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:25:13,480 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:25:13,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:13,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:13,542 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:13,545 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:25:13,545 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:13,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:13,545 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:13,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:13,545 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:13,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:13,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:13,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration3_Loop [2022-02-21 03:25:13,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:13,546 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:13,546 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:25:13,549 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:25:13,552 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:25:13,554 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:25:13,558 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:25:13,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:13,609 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:13,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,640 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:25:13,641 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:25:13,642 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:25:13,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:13,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:13,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:13,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:13,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:13,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:13,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:13,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:13,665 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:25:13,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,666 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:25:13,667 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:25:13,669 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:25:13,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:13,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:13,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:13,675 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:13,675 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:13,676 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:13,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:13,677 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:13,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-02-21 03:25:13,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,693 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:25:13,694 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:25:13,697 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:13,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:13,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:13,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:13,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:13,704 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:13,704 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:13,735 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:13,753 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:25:13,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,756 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:25:13,756 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:25:13,758 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:25:13,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:13,764 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:13,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:13,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:13,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:13,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:13,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:13,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:13,784 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-02-21 03:25:13,784 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:13,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,786 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:25:13,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:13,819 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:13,819 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:13,819 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:13,819 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:25:13,823 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:25:13,837 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:25:13,849 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:13,852 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);" "assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1;" [2022-02-21 03:25:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,885 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#unseeded} assume { :begin_inline_ULTIMATE.init } true; {260#unseeded} is VALID [2022-02-21 03:25:13,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {260#unseeded} is VALID [2022-02-21 03:25:13,886 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:13,886 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:13,887 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:13,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,891 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {293#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:25:13,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {293#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; {273#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:25:13,928 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:25:13,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:13,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,933 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:25:13,933 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,950 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 21 transitions. Complement of second has 5 states. [2022-02-21 03:25:13,950 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:25:13,950 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:13,950 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,950 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-02-21 03:25:13,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,952 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,952 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:13,952 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:13,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:13,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,953 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:25:13,953 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:13,954 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:25:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,954 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:25:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,955 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:25:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,956 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:25:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,957 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:25:13,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,957 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:25:13,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,958 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:25:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,958 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:25:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,959 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:25:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,960 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:25:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,960 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:25:13,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,961 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:13,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#unseeded} assume { :begin_inline_ULTIMATE.init } true; {260#unseeded} is VALID [2022-02-21 03:25:13,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {260#unseeded} is VALID [2022-02-21 03:25:13,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:13,992 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:13,992 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:13,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,996 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {337#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:25:14,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {337#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; {273#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:25:14,015 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:25:14,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:14,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,019 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:25:14,020 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,033 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 21 transitions. Complement of second has 5 states. [2022-02-21 03:25:14,033 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:25:14,034 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-02-21 03:25:14,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,035 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,035 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:14,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,036 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:14,036 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 21 transitions. cyclomatic complexity: 10 [2022-02-21 03:25:14,036 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:14,036 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:25:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,037 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:25:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,038 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:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:14,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,039 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:25:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,039 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:25:14,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,040 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:25:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,041 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:25:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,041 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:25:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,042 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:25:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,042 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:25:14,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 21 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,043 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:25:14,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,044 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:14,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,072 INFO L290 TraceCheckUtils]: 0: Hoare triple {260#unseeded} assume { :begin_inline_ULTIMATE.init } true; {260#unseeded} is VALID [2022-02-21 03:25:14,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {260#unseeded} is VALID [2022-02-21 03:25:14,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:14,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:14,074 INFO L290 TraceCheckUtils]: 4: Hoare triple {260#unseeded} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {260#unseeded} is VALID [2022-02-21 03:25:14,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#unseeded} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {260#unseeded} is VALID [2022-02-21 03:25:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,080 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#(>= oldRank0 |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {381#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-21 03:25:14,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {381#(and (>= oldRank0 |ULTIMATE.start_main_~y~0#1|) (< 0 |ULTIMATE.start_main_~y~0#1|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;main_~y~0#1 := main_~y~0#1 - 1; {273#(or (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~y~0#1|)) unseeded)} is VALID [2022-02-21 03:25:14,100 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:25:14,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,104 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:14,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,105 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:25:14,105 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,122 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 17 transitions. cyclomatic complexity: 8. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 24 transitions. Complement of second has 4 states. [2022-02-21 03:25:14,122 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:25:14,122 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,123 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2022-02-21 03:25:14,124 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:14,124 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,124 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,124 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:14,124 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:14,125 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:14,125 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:14,125 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:25:14,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,126 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:25:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,126 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:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:14,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 16 letters. Loop has 16 letters. [2022-02-21 03:25:14,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 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:25:14,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 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:25:14,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,129 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:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:25:14,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,129 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:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,130 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:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,131 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:25:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 24 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,131 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:25:14,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:14,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:25:14,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:25:14,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 24 transitions. cyclomatic complexity: 11 [2022-02-21 03:25:14,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:14,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 20 transitions. [2022-02-21 03:25:14,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:25:14,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-02-21 03:25:14,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2022-02-21 03:25:14,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:14,134 INFO L681 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2022-02-21 03:25:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2022-02-21 03:25:14,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 6. [2022-02-21 03:25:14,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:14,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:25:14,135 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:25:14,135 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:25:14,136 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:14,136 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:25:14,136 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:25:14,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:25:14,137 INFO L87 Difference]: Start difference. First operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states and 20 transitions. [2022-02-21 03:25:14,137 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:14,138 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2022-02-21 03:25:14,138 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2022-02-21 03:25:14,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:14,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:14,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:14,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:14,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 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:25:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2022-02-21 03:25:14,139 INFO L704 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2022-02-21 03:25:14,139 INFO L587 BuchiCegarLoop]: Abstraction has 6 states and 8 transitions. [2022-02-21 03:25:14,139 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:14,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. [2022-02-21 03:25:14,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:25:14,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,139 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:14,139 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:25:14,140 INFO L791 eck$LassoCheckResult]: Stem: 411#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 412#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 408#L18-2 [2022-02-21 03:25:14,140 INFO L793 eck$LassoCheckResult]: Loop: 408#L18-2 assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); 407#L18 assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 408#L18-2 [2022-02-21 03:25:14,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,140 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-02-21 03:25:14,140 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970654914] [2022-02-21 03:25:14,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,144 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1316, now seen corresponding path program 1 times [2022-02-21 03:25:14,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188723139] [2022-02-21 03:25:14,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,153 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,155 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,155 INFO L85 PathProgramCache]: Analyzing trace with hash 925798, now seen corresponding path program 3 times [2022-02-21 03:25:14,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:14,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78443402] [2022-02-21 03:25:14,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,159 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:14,161 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:14,182 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:14,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:14,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:14,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:14,183 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:14,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:14,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:14,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration4_Loop [2022-02-21 03:25:14,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:14,183 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:14,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:14,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:14,189 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:25:14,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:14,211 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:25:14,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:14,264 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:14,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,267 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:25:14,267 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:25:14,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:14,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:14,289 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:14,289 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:14,314 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:25:14,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,315 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:25:14,319 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:25:14,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:14,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:14,364 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:14,364 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2#1=-1} Honda state: {ULTIMATE.start_main_#t~nondet2#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:14,381 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:25:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,382 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:25:14,382 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:25:14,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:14,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:14,405 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:14,405 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:14,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-02-21 03:25:14,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,424 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:25:14,425 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:25:14,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:14,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:14,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-02-21 03:25:14,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,472 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:25:14,473 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:25:14,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:14,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:14,499 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:14,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:14,502 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:14,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:14,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:14,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:14,503 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:14,503 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,503 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:14,503 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:14,503 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig4.c_Iteration4_Loop [2022-02-21 03:25:14,503 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:14,503 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:14,504 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:25:14,506 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:25:14,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:14,526 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:25:14,528 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:25:14,588 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:14,589 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:14,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,590 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:25:14,591 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:25:14,592 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:25:14,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:14,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:14,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:14,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:14,599 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:14,599 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:14,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:14,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-02-21 03:25:14,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,640 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:25:14,641 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:25:14,642 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:25:14,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:14,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:14,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:14,648 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:25:14,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:14,649 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 03:25:14,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:14,658 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:14,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-02-21 03:25:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,675 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:25:14,681 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:25:14,687 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:25:14,695 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:14,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:14,696 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:14,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:14,696 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:14,696 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:14,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:14,703 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:25:14,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:14,714 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:14,714 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:14,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:14,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:14,715 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:25:14,716 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:25:14,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:14,718 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:14,718 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:14,718 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:25:14,735 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:25:14,739 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:14,742 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0);" "assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;" [2022-02-21 03:25:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:14,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,767 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {476#unseeded} assume { :begin_inline_ULTIMATE.init } true; {476#unseeded} is VALID [2022-02-21 03:25:14,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {476#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_#t~nondet2#1, main_#t~nondet3#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {476#unseeded} is VALID [2022-02-21 03:25:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:14,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:14,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {479#(>= oldRank0 |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 > 0 && main_~y~0#1 > 0); {497#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:25:14,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#(and (< 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 |ULTIMATE.start_main_~x~0#1|))} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1;main_~x~0#1 := main_~x~0#1 - 1;main_~y~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; {489#(or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_main_~x~0#1|)))} is VALID [2022-02-21 03:25:14,816 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:25:14,817 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:25:14,820 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:25:14,820 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:25:14,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,820 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:25:14,820 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3 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:25:14,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 8 transitions. cyclomatic complexity: 3. 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 12 states and 18 transitions. Complement of second has 4 states. [2022-02-21 03:25:14,837 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:25:14,837 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:25:14,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,837 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:25:14,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:14,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:14,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2022-02-21 03:25:14,838 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:14,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:14,838 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 8 transitions. cyclomatic complexity: 3 [2022-02-21 03:25:14,838 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:14,838 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:25:14,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:25:14,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:14,839 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:14,839 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:14,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:14,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,839 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:25:14,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:14,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,839 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:25:14,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 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 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 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 6 letters. Loop has 6 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 6 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 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 3 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:14,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 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:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 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:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 8 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 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:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:14,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,842 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:14,842 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:25:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:14,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:25:14,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:25:14,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 4 letters. [2022-02-21 03:25:14,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:14,843 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:25:14,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:14,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2022-02-21 03:25:14,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:14,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:14,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:14,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:14,843 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:14,843 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:14,843 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:14,843 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:25:14,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:14,844 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:14,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:14,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:14 BoogieIcfgContainer [2022-02-21 03:25:14,848 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:14,849 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:14,849 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:14,849 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:14,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:11" (3/4) ... [2022-02-21 03:25:14,851 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:14,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:14,852 INFO L158 Benchmark]: Toolchain (without parser) took 4250.42ms. Allocated memory was 100.7MB in the beginning and 151.0MB in the end (delta: 50.3MB). Free memory was 67.3MB in the beginning and 111.5MB in the end (delta: -44.1MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-02-21 03:25:14,852 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:14,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.76ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 67.1MB in the beginning and 99.9MB in the end (delta: -32.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:14,852 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.50ms. Allocated memory is still 123.7MB. Free memory was 99.9MB in the beginning and 98.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:14,852 INFO L158 Benchmark]: Boogie Preprocessor took 19.22ms. Allocated memory is still 123.7MB. Free memory was 98.5MB in the beginning and 97.8MB in the end (delta: 738.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:25:14,853 INFO L158 Benchmark]: RCFGBuilder took 221.07ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 89.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:14,853 INFO L158 Benchmark]: BuchiAutomizer took 3760.95ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 89.4MB in the beginning and 111.5MB in the end (delta: -22.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-02-21 03:25:14,853 INFO L158 Benchmark]: Witness Printer took 2.20ms. Allocated memory is still 151.0MB. Free memory is still 111.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:14,854 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.17ms. Allocated memory is still 100.7MB. Free memory was 55.2MB in the beginning and 55.1MB in the end (delta: 44.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.76ms. Allocated memory was 100.7MB in the beginning and 123.7MB in the end (delta: 23.1MB). Free memory was 67.1MB in the beginning and 99.9MB in the end (delta: -32.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.50ms. Allocated memory is still 123.7MB. Free memory was 99.9MB in the beginning and 98.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.22ms. Allocated memory is still 123.7MB. Free memory was 98.5MB in the beginning and 97.8MB in the end (delta: 738.0kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 221.07ms. Allocated memory is still 123.7MB. Free memory was 97.8MB in the beginning and 89.4MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3760.95ms. Allocated memory was 123.7MB in the beginning and 151.0MB in the end (delta: 27.3MB). Free memory was 89.4MB in the beginning and 111.5MB in the end (delta: -22.0MB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. * Witness Printer took 2.20ms. Allocated memory is still 151.0MB. Free memory is still 111.5MB. 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 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function y and consists of 3 locations. One deterministic module has affine ranking function x and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 40 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 33 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax171 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 12 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:25:14,887 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:25:15,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE