./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.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 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:24:40,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:24:40,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:24:40,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:24:40,533 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:24:40,534 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:24:40,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:24:40,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:24:40,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:24:40,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:24:40,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:24:40,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:24:40,540 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:24:40,541 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:24:40,542 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:24:40,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:24:40,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:24:40,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:24:40,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:24:40,552 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:24:40,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:24:40,554 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:24:40,555 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:24:40,555 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:24:40,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:24:40,560 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:24:40,560 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:24:40,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:24:40,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:24:40,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:24:40,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:24:40,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:24:40,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:24:40,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:24:40,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:24:40,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:24:40,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:24:40,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:24:40,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:24:40,566 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:24:40,567 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:24:40,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:24:40,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:24:40,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:24:40,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:24:40,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:24:40,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:24:40,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:24:40,584 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:24:40,584 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:24:40,585 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:24:40,585 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:24:40,585 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:24:40,585 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:24:40,585 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:24:40,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:24:40,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:24:40,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:24:40,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:24:40,586 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:24:40,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:24:40,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:24:40,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:24:40,587 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:24:40,587 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:24:40,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:24:40,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:24:40,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:24:40,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:24:40,588 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:24:40,589 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:24:40,589 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 -> 024b54dcc71a4cff37fb88a3019598a20adbf40036f66c2a7f758cfecaaffadc [2022-02-21 03:24:40,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:24:40,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:24:40,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:24:40,767 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:24:40,768 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:24:40,769 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:24:40,815 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f806725/7c53d657579f4dc59758762e0ad3786e/FLAG4e45b9692 [2022-02-21 03:24:41,197 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:24:41,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:24:41,207 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f806725/7c53d657579f4dc59758762e0ad3786e/FLAG4e45b9692 [2022-02-21 03:24:41,221 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f806725/7c53d657579f4dc59758762e0ad3786e [2022-02-21 03:24:41,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:24:41,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:24:41,228 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,228 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:24:41,230 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:24:41,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3317c2b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:24:41,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:24:41,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,380 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:24:41,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:24:41,399 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:24:41,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41 WrapperNode [2022-02-21 03:24:41,400 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:24:41,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:24:41,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:24:41,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,424 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2022-02-21 03:24:41,424 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:24:41,425 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,425 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:24:41,425 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:24:41,431 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,431 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,432 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,436 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,436 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,437 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:24:41,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:24:41,438 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:24:41,438 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:24:41,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (1/1) ... [2022-02-21 03:24:41,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:41,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:41,519 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:41,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:24:41,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:24:41,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:24:41,588 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:24:41,589 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:24:41,703 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:24:41,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:24:41,708 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:24:41,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41 BoogieIcfgContainer [2022-02-21 03:24:41,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:24:41,710 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:24:41,711 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:24:41,713 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:24:41,713 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,714 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:24:41" (1/3) ... [2022-02-21 03:24:41,714 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53f1fe4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:24:41" (2/3) ... [2022-02-21 03:24:41,715 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@53f1fe4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:24:41, skipping insertion in model container [2022-02-21 03:24:41,715 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:24:41,715 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41" (3/3) ... [2022-02-21 03:24:41,716 INFO L388 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-wise.c [2022-02-21 03:24:41,774 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:24:41,775 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:24:41,775 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:24:41,775 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:24:41,775 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:24:41,775 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:24:41,775 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:24:41,776 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:24:41,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,818 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:41,818 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:41,818 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:24:41,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:41,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:41,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:41,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:41,821 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:24:41,821 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:41,825 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~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; 5#L17true assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; 3#L19-2true [2022-02-21 03:24:41,825 INFO L793 eck$LassoCheckResult]: Loop: 3#L19-2true assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 10#L19true assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; 3#L19-2true [2022-02-21 03:24:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,830 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-21 03:24:41,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932261471] [2022-02-21 03:24:41,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,929 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,948 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 1 times [2022-02-21 03:24:41,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286026005] [2022-02-21 03:24:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:41,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,978 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:41,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash 28693989, now seen corresponding path program 1 times [2022-02-21 03:24:41,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:41,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162910234] [2022-02-21 03:24:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:41,996 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,005 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:42,075 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,076 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,076 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,076 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:42,076 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,076 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration1_Loop [2022-02-21 03:24:42,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,188 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,189 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:42,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,192 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 03:24:42,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,220 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:24:42,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,273 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:42,273 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:42,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,292 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:24:42,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:42,295 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,334 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:24:42,337 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:42,337 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:42,450 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:42,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,455 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:42,455 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:42,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:42,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:42,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:42,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:42,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:42,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration1_Loop [2022-02-21 03:24:42,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:42,456 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:42,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:42,521 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:42,524 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,526 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:24:42,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,542 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,542 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,580 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:24:42,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,588 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,588 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,588 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:42,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:42,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:42,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:24:42,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:42,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:42,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:42,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:42,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:42,637 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:42,638 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:42,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:42,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:42,658 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:42,658 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:42,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:42,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:42,661 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:42,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:24:42,701 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:42,701 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:42,701 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:42,702 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~y~0#1 - 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:24:42,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:42,728 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:42,732 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2);" "assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1;" [2022-02-21 03:24:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID [2022-02-21 03:24:42,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~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; {19#unseeded} is VALID [2022-02-21 03:24:42,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {19#unseeded} is VALID [2022-02-21 03:24:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,809 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:42,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:42,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {43#(and (or (< (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (< (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:24:42,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#(and (or (< (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (< (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {32#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:24:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:42,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:42,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:42,874 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 36 transitions. Complement of second has 8 states. [2022-02-21 03:24:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:42,917 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,922 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:42,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2022-02-21 03:24:42,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,925 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,926 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,929 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,930 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,930 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,933 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:24:42,933 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,933 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:42,934 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:42,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:42,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 29 letters. Loop has 29 letters. [2022-02-21 03:24:42,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:42,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:42,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:42,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:24:42,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:42,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:42,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:42,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:24:42,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:42,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 36 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:42,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,952 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:42,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2022-02-21 03:24:42,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:24:42,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:42,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 3 letters. Loop has 4 letters. [2022-02-21 03:24:42,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:42,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. cyclomatic complexity: 9 [2022-02-21 03:24:42,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 9 states and 12 transitions. [2022-02-21 03:24:42,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:42,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2022-02-21 03:24:42,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2022-02-21 03:24:42,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:42,963 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2022-02-21 03:24:42,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:24:42,980 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:42,980 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,981 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,982 INFO L87 Difference]: Start difference. First operand 9 states and 12 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,984 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,985 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:42,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:24:42,986 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 12 transitions. [2022-02-21 03:24:42,986 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:42,987 INFO L93 Difference]: Finished difference Result 9 states and 12 transitions. [2022-02-21 03:24:42,987 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:42,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:42,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:42,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 12 transitions. [2022-02-21 03:24:42,989 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:42,989 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2022-02-21 03:24:42,989 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:24:42,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2022-02-21 03:24:42,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:42,990 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:42,990 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:42,990 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:24:42,990 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:42,990 INFO L791 eck$LassoCheckResult]: Stem: 94#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 95#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_~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; 92#L17 assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; 93#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 90#L19 assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; 87#L19-2 [2022-02-21 03:24:42,990 INFO L793 eck$LassoCheckResult]: Loop: 87#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 88#L19 assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; 87#L19-2 [2022-02-21 03:24:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:42,991 INFO L85 PathProgramCache]: Analyzing trace with hash 28693991, now seen corresponding path program 1 times [2022-02-21 03:24:42,991 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:42,991 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51531181] [2022-02-21 03:24:42,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:42,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:42,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,006 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1412, now seen corresponding path program 2 times [2022-02-21 03:24:43,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172871015] [2022-02-21 03:24:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,013 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,015 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1805122026, now seen corresponding path program 1 times [2022-02-21 03:24:43,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,016 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746263904] [2022-02-21 03:24:43,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,063 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#true} assume { :begin_inline_ULTIMATE.init } true; {149#true} is VALID [2022-02-21 03:24:43,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~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; {149#true} is VALID [2022-02-21 03:24:43,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {149#true} is VALID [2022-02-21 03:24:43,064 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#true} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {151#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:24:43,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {152#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:24:43,065 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#(<= (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {153#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} is VALID [2022-02-21 03:24:43,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {153#(<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {150#false} is VALID [2022-02-21 03:24:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:43,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:43,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746263904] [2022-02-21 03:24:43,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746263904] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:43,068 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:43,068 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:24:43,068 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532668306] [2022-02-21 03:24:43,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:43,087 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,088 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:43,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration2_Loop [2022-02-21 03:24:43,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,088 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,135 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:43,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,144 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,160 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,160 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:24:43,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,193 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:43,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,213 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,217 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,217 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:24:43,234 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:43,234 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:43,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,253 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,270 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:24:43,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,306 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:24:43,309 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:43,309 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,421 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:43,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,426 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,426 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,426 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,426 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,426 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:43,426 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,426 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,426 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,426 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration2_Loop [2022-02-21 03:24:43,426 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,426 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,476 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,476 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:43,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,479 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:24:43,481 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:43,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,487 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,504 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,524 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:24:43,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:43,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,534 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:43,534 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:43,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:43,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:24:43,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:43,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:43,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:43,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:43,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:43,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:43,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:43,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:43,599 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:43,603 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:43,603 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:43,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,604 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:24:43,606 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:43,606 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:43,606 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:43,606 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = 1*ULTIMATE.start_main_~y~0#1 - 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:24:43,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:43,627 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:43,630 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2);" "assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1;" [2022-02-21 03:24:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#unseeded} assume { :begin_inline_ULTIMATE.init } true; {154#unseeded} is VALID [2022-02-21 03:24:43,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#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_~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; {154#unseeded} is VALID [2022-02-21 03:24:43,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {154#unseeded} is VALID [2022-02-21 03:24:43,658 INFO L290 TraceCheckUtils]: 3: Hoare triple {154#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {154#unseeded} is VALID [2022-02-21 03:24:43,658 INFO L290 TraceCheckUtils]: 4: Hoare triple {154#unseeded} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {154#unseeded} is VALID [2022-02-21 03:24:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,661 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:24:43,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:43,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:43,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {157#(>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {184#(and (or (< (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (< (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} is VALID [2022-02-21 03:24:43,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {184#(and (or (< (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (< (+ 2 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|)) (>= oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|))))} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {167#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ |ULTIMATE.start_main_~y~0#1| (* (- 1) |ULTIMATE.start_main_~x~0#1|)))))} is VALID [2022-02-21 03:24:43,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:43,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:43,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,697 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:43,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 9 states and 12 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 18 transitions. Complement of second has 5 states. [2022-02-21 03:24:43,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:43,714 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,715 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:43,715 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:43,715 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,716 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:43,716 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:43,716 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:43,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 18 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:43,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,720 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:43,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2022-02-21 03:24:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:43,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 5 letters. Loop has 4 letters. [2022-02-21 03:24:43,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:43,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. cyclomatic complexity: 8 [2022-02-21 03:24:43,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,737 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:24:43,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-02-21 03:24:43,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:43,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,737 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:43,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:24:43,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,738 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,738 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,738 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,739 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:24:43,739 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:24:43,739 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 13 states and 18 transitions. [2022-02-21 03:24:43,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,740 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2022-02-21 03:24:43,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 18 transitions. [2022-02-21 03:24:43,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2022-02-21 03:24:43,741 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2022-02-21 03:24:43,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:43,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:24:43,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:24:43,743 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:43,766 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2022-02-21 03:24:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:24:43,766 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:43,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2022-02-21 03:24:43,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 11 states and 13 transitions. [2022-02-21 03:24:43,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:24:43,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:24:43,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2022-02-21 03:24:43,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:43,772 INFO L681 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2022-02-21 03:24:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2022-02-21 03:24:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 8. [2022-02-21 03:24:43,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:43,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,773 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,773 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,773 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,774 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:24:43,774 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:24:43,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 03:24:43,774 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 11 states and 13 transitions. [2022-02-21 03:24:43,774 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:43,775 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2022-02-21 03:24:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2022-02-21 03:24:43,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:43,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:43,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:43,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-02-21 03:24:43,775 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,775 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-02-21 03:24:43,775 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:24:43,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-02-21 03:24:43,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:43,776 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:43,776 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:43,776 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:24:43,776 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:43,776 INFO L791 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 302#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_~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; 299#L17 assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; 300#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 296#L19 [2022-02-21 03:24:43,776 INFO L793 eck$LassoCheckResult]: Loop: 296#L19 assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; 295#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 296#L19 [2022-02-21 03:24:43,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash 925612, now seen corresponding path program 1 times [2022-02-21 03:24:43,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,777 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343653795] [2022-02-21 03:24:43,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,783 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1564, now seen corresponding path program 1 times [2022-02-21 03:24:43,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102913873] [2022-02-21 03:24:43,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,789 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:43,789 INFO L85 PathProgramCache]: Analyzing trace with hash 889513735, now seen corresponding path program 2 times [2022-02-21 03:24:43,789 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:43,789 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352567691] [2022-02-21 03:24:43,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:43,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:43,798 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:43,813 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:43,813 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:43,813 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:43,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:43,813 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:43,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:43,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:43,814 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration3_Loop [2022-02-21 03:24:43,814 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:43,814 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:43,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:43,853 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:43,853 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:43,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,854 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:24:43,893 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:43,893 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:43,929 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:24:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:43,930 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:43,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:24:43,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:43,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,143 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:44,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 03:24:44,147 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,147 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:44,148 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,148 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,148 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,148 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration3_Loop [2022-02-21 03:24:44,148 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,148 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,192 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,192 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:44,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,193 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 03:24:44,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:44,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:44,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:44,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:44,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:44,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:44,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:44,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:44,218 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:44,220 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:44,220 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:44,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,221 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:24:44,224 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:44,224 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:44,224 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:44,224 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~y~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~y~0#1 Supporting invariants [] [2022-02-21 03:24:44,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 03:24:44,243 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:44,246 INFO L390 LassoCheck]: Loop: "assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1;" "assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2);" [2022-02-21 03:24:44,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#unseeded} assume { :begin_inline_ULTIMATE.init } true; {364#unseeded} is VALID [2022-02-21 03:24:44,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#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_~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; {364#unseeded} is VALID [2022-02-21 03:24:44,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {364#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {364#unseeded} is VALID [2022-02-21 03:24:44,271 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {364#unseeded} is VALID [2022-02-21 03:24:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,274 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:44,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:44,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {367#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {391#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:24:44,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {391#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {377#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:24:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,303 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:24:44,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:44,306 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:24:44,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,306 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:44,307 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4 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:24:44,318 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 4. 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 13 states and 15 transitions. Complement of second has 5 states. [2022-02-21 03:24:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:44,318 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,319 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:24:44,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:44,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,319 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2022-02-21 03:24:44,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:44,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,320 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 10 transitions. cyclomatic complexity: 4 [2022-02-21 03:24:44,320 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:44,320 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:24:44,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:44,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:44,321 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:44,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:44,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,322 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:24:44,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,322 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 1 letters. [2022-02-21 03:24:44,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,339 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:24:44,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:24:44,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,341 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:24:44,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:44,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,341 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:24:44,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:44,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:44,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,342 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:24:44,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2022-02-21 03:24:44,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,343 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:24:44,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,344 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 1 letters. [2022-02-21 03:24:44,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:44,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,344 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:24:44,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 10 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:44,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,345 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:24:44,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 15 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:44,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,345 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:44,346 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:24:44,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2022-02-21 03:24:44,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2022-02-21 03:24:44,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:44,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:24:44,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:44,347 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. cyclomatic complexity: 5 [2022-02-21 03:24:44,348 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:44,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 9 states and 10 transitions. [2022-02-21 03:24:44,348 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2022-02-21 03:24:44,348 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2022-02-21 03:24:44,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-02-21 03:24:44,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:24:44,349 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:24:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-02-21 03:24:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2022-02-21 03:24:44,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:24:44,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,350 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,350 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,350 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,351 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:24:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:24:44,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:24:44,351 INFO L87 Difference]: Start difference. First operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 9 states and 10 transitions. [2022-02-21 03:24:44,352 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:24:44,352 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2022-02-21 03:24:44,352 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:24:44,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:24:44,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:24:44,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:24:44,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:24:44,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2022-02-21 03:24:44,353 INFO L704 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:24:44,353 INFO L587 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2022-02-21 03:24:44,354 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:24:44,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2022-02-21 03:24:44,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:44,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:44,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:44,357 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-02-21 03:24:44,357 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:24:44,357 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 421#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_~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; 419#L17 assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; 415#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 416#L19 assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; 417#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 418#L19 [2022-02-21 03:24:44,357 INFO L793 eck$LassoCheckResult]: Loop: 418#L19 assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; 422#L19-2 assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); 418#L19 [2022-02-21 03:24:44,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,358 INFO L85 PathProgramCache]: Analyzing trace with hash 889513673, now seen corresponding path program 2 times [2022-02-21 03:24:44,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273547290] [2022-02-21 03:24:44,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,380 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1564, now seen corresponding path program 2 times [2022-02-21 03:24:44,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917722940] [2022-02-21 03:24:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,384 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:24:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:24:44,386 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:24:44,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 124148452, now seen corresponding path program 2 times [2022-02-21 03:24:44,387 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:24:44,387 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871580647] [2022-02-21 03:24:44,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:24:44,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:24:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:44,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {484#true} assume { :begin_inline_ULTIMATE.init } true; {484#true} is VALID [2022-02-21 03:24:44,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {484#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~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; {484#true} is VALID [2022-02-21 03:24:44,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#true} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {484#true} is VALID [2022-02-21 03:24:44,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#true} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {486#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:24:44,457 INFO L290 TraceCheckUtils]: 4: Hoare triple {486#(or (<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (<= (+ 3 |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {487#(<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:24:44,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {487#(<= (+ 2 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {488#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:24:44,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {488#(<= (+ 3 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|)} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {485#false} is VALID [2022-02-21 03:24:44,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {485#false} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {485#false} is VALID [2022-02-21 03:24:44,458 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:44,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:24:44,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871580647] [2022-02-21 03:24:44,459 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871580647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:24:44,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:24:44,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:24:44,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918572968] [2022-02-21 03:24:44,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:24:44,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,481 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,481 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:24:44,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,482 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,482 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,482 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration4_Loop [2022-02-21 03:24:44,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,482 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,520 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,520 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:24:44,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,521 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:44,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:24:44,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:44,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:44,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,579 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,596 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:44,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:24:44,616 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:24:44,616 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_7=0} Honda state: {v_rep~unnamed0~0~false_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:24:44,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,644 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:24:44,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:24:44,646 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,684 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:24:44,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,685 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:24:44,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:24:44,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:24:44,896 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:24:44,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:44,902 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:24:44,902 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:24:44,902 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:24:44,902 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:24:44,902 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:24:44,902 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,902 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:24:44,902 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:24:44,902 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-wise.c_Iteration4_Loop [2022-02-21 03:24:44,902 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:24:44,902 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:24:44,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:24:44,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:24:44,947 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:24:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:44,985 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:44,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:24:44,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:24:44,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:44,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:44,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:44,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:44,997 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:44,997 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,028 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:24:45,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:45,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:24:45,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:24:45,054 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:24:45,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-02-21 03:24:45,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,072 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:24:45,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:24:45,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:24:45,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:24:45,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:24:45,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:24:45,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:24:45,083 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:24:45,083 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:24:45,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:24:45,101 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:24:45,101 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:24:45,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:24:45,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:24:45,102 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:24:45,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:24:45,105 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:24:45,105 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:24:45,105 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:24:45,105 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:24:45,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,128 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:24:45,143 INFO L390 LassoCheck]: Loop: "assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1;" "assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2);" [2022-02-21 03:24:45,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#unseeded} assume { :begin_inline_ULTIMATE.init } true; {489#unseeded} is VALID [2022-02-21 03:24:45,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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_~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; {489#unseeded} is VALID [2022-02-21 03:24:45,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {489#unseeded} is VALID [2022-02-21 03:24:45,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#unseeded} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {489#unseeded} is VALID [2022-02-21 03:24:45,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,181 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,210 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {522#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:24:45,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {522#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {502#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:24:45,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:45,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:45,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,216 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:45,216 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,224 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 10 transitions. Complement of second has 3 states. [2022-02-21 03:24:45,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:45,224 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,225 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:24:45,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:45,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,225 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:45,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,226 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 4 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:45,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,226 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:45,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,229 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-02-21 03:24:45,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,230 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#unseeded} assume { :begin_inline_ULTIMATE.init } true; {489#unseeded} is VALID [2022-02-21 03:24:45,260 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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_~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; {489#unseeded} is VALID [2022-02-21 03:24:45,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {489#unseeded} is VALID [2022-02-21 03:24:45,261 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,261 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#unseeded} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {489#unseeded} is VALID [2022-02-21 03:24:45,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,265 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {558#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:24:45,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {558#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {502#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:24:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:45,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:45,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,296 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:45,296 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,306 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 10 transitions. Complement of second has 3 states. [2022-02-21 03:24:45,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:45,306 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,307 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:24:45,307 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:45,307 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,307 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,307 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:45,307 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 4 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,308 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,308 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:45,308 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 10 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,308 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 10 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,311 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 4 transitions. [2022-02-21 03:24:45,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 4 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,312 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:24:45,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:24:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {489#unseeded} assume { :begin_inline_ULTIMATE.init } true; {489#unseeded} is VALID [2022-02-21 03:24:45,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {489#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_~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; {489#unseeded} is VALID [2022-02-21 03:24:45,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {489#unseeded} assume main_~x~0#1 >= 0 && main_~y~0#1 >= 0; {489#unseeded} is VALID [2022-02-21 03:24:45,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {489#unseeded} assume main_~x~0#1 < main_~y~0#1;main_~x~0#1 := 1 + main_~x~0#1; {489#unseeded} is VALID [2022-02-21 03:24:45,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {489#unseeded} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {489#unseeded} is VALID [2022-02-21 03:24:45,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,344 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-21 03:24:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:24:45,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:24:45,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {492#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !(main_~x~0#1 < main_~y~0#1);main_~y~0#1 := 1 + main_~y~0#1; {594#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-21 03:24:45,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {594#(and (<= (+ |ULTIMATE.start_main_~x~0#1| 1) (+ |ULTIMATE.start_main_~y~0#1| oldRank0)) (not (< (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)))} assume !!(main_~x~0#1 - main_~y~0#1 > 2 || main_~y~0#1 - main_~x~0#1 > 2); {502#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:24:45,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:24:45,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:45,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,380 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:24:45,380 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,395 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 9 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 10 states and 11 transitions. Complement of second has 4 states. [2022-02-21 03:24:45,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:24:45,395 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:45,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:24:45,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:24:45,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2022-02-21 03:24:45,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,396 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 9 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,396 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:24:45,396 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:24:45,396 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:24:45,396 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 11 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,396 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,396 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:24:45,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 8 letters. Loop has 8 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 7 letters. Loop has 2 letters. [2022-02-21 03:24:45,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 9 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 11 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:24:45,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,399 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:24:45,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:24:45,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:24:45,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:24:45,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 8 letters. Loop has 2 letters. [2022-02-21 03:24:45,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2022-02-21 03:24:45,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:24:45,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. cyclomatic complexity: 3 [2022-02-21 03:24:45,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2022-02-21 03:24:45,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:45,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:45,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:45,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:45,401 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:45,401 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:45,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:24:45,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:24:45,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:24:45,401 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 1.6) 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:24:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:24:45,401 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:24:45,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:24:45,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) 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:24:45,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:24:45,408 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:24:45,408 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:24:45,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:24:45,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:24:45,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:24:45,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:24:45,408 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:45,409 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:45,409 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:24:45,409 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:24:45,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:24:45,409 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:24:45,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:24:45,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:24:45 BoogieIcfgContainer [2022-02-21 03:24:45,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:24:45,414 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:24:45,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:24:45,414 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:24:45,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:24:41" (3/4) ... [2022-02-21 03:24:45,416 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:24:45,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:24:45,416 INFO L158 Benchmark]: Toolchain (without parser) took 4190.86ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 85.2MB in the beginning and 52.1MB in the end (delta: 33.1MB). Peak memory consumption was 56.2MB. Max. memory is 16.1GB. [2022-02-21 03:24:45,416 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 171.98ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 88.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.89ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: Boogie Preprocessor took 12.25ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 86.0MB in the end (delta: 810.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: RCFGBuilder took 272.03ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 77.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: BuchiAutomizer took 3702.85ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 77.2MB in the beginning and 53.1MB in the end (delta: 24.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-02-21 03:24:45,417 INFO L158 Benchmark]: Witness Printer took 1.96ms. Allocated memory is still 136.3MB. Free memory was 53.1MB in the beginning and 52.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:24:45,418 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.19ms. Allocated memory is still 113.2MB. Free memory is still 67.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 171.98ms. Allocated memory is still 113.2MB. Free memory was 84.9MB in the beginning and 88.4MB in the end (delta: -3.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.89ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 12.25ms. Allocated memory is still 113.2MB. Free memory was 86.9MB in the beginning and 86.0MB in the end (delta: 810.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.03ms. Allocated memory is still 113.2MB. Free memory was 86.0MB in the beginning and 77.2MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3702.85ms. Allocated memory was 113.2MB in the beginning and 136.3MB in the end (delta: 23.1MB). Free memory was 77.2MB in the beginning and 53.1MB in the end (delta: 24.1MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 1.96ms. Allocated memory is still 136.3MB. Free memory was 53.1MB in the beginning and 52.1MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function y + -1 * x and consists of 5 locations. One deterministic module has affine ranking function y + -1 * x and consists of 3 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 2.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 9 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 38 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:24:45,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:24:45,654 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