./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/LeeJonesBen-Amram-POPL2001-Ex4.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 554582d6fc3de8e87f5dd30e5019302b6e1b96be ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:53,529 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:53,531 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:53,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:53,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:53,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:53,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:53,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:53,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:53,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:53,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:53,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:53,563 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:53,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:53,565 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:53,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:53,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:53,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:53,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:53,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:53,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:53,576 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:53,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:53,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:53,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:53,582 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:53,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:53,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:53,584 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:53,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:53,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:53,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:53,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:53,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:53,590 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:53,590 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:53,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:53,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:53,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:53,593 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:53,594 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:53,595 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:53,612 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:53,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:53,614 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:53,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:53,614 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:53,615 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:53,615 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:53,615 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:53,616 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:53,616 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:53,616 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:53,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:53,617 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:53,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:53,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:53,617 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:53,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:53,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:53,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:53,619 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:53,619 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:53,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:53,620 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:53,620 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:53,620 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:53,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:53,621 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:53,621 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:53,621 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:53,622 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:53,623 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> 554582d6fc3de8e87f5dd30e5019302b6e1b96be [2020-07-29 01:28:53,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:53,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:53,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:53,957 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:53,958 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:53,959 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c [2020-07-29 01:28:54,029 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f20bb76fc/1509eb8d162740188a7bd1e2c558e4f8/FLAGe50767171 [2020-07-29 01:28:54,459 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:54,459 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/LeeJonesBen-Amram-POPL2001-Ex4.c [2020-07-29 01:28:54,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f20bb76fc/1509eb8d162740188a7bd1e2c558e4f8/FLAGe50767171 [2020-07-29 01:28:54,839 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f20bb76fc/1509eb8d162740188a7bd1e2c558e4f8 [2020-07-29 01:28:54,842 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:54,845 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:54,846 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:54,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:54,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:54,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:54" (1/1) ... [2020-07-29 01:28:54,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2000f851 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:54, skipping insertion in model container [2020-07-29 01:28:54,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:54" (1/1) ... [2020-07-29 01:28:54,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:54,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:55,048 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:55,052 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:55,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:55,091 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:55,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55 WrapperNode [2020-07-29 01:28:55,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:55,095 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:55,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:55,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:55,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:55,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:55,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:55,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:55,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... [2020-07-29 01:28:55,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:55,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:55,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:55,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:55,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:55,280 INFO L130 BoogieDeclarations]: Found specification of procedure p [2020-07-29 01:28:55,281 INFO L138 BoogieDeclarations]: Found implementation of procedure p [2020-07-29 01:28:55,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:55,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:55,536 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:55,536 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:28:55,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:55 BoogieIcfgContainer [2020-07-29 01:28:55,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:55,542 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:55,542 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:55,546 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:55,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:54" (1/3) ... [2020-07-29 01:28:55,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789e7956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:55, skipping insertion in model container [2020-07-29 01:28:55,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:55" (2/3) ... [2020-07-29 01:28:55,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@789e7956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:55, skipping insertion in model container [2020-07-29 01:28:55,550 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:55,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:55" (3/3) ... [2020-07-29 01:28:55,552 INFO L371 chiAutomizerObserver]: Analyzing ICFG LeeJonesBen-Amram-POPL2001-Ex4.c [2020-07-29 01:28:55,608 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:55,610 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:55,611 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:55,611 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:55,613 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:55,614 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:55,614 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:55,614 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:55,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:28:55,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:55,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,691 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:55,691 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:55,691 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:55,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:28:55,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:55,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:55,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:55,697 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:55,698 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:55,704 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L28true assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 10#L29true call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 11#pENTRYtrue [2020-07-29 01:28:55,705 INFO L796 eck$LassoCheckResult]: Loop: 11#pENTRYtrue ~m := #in~m;~n := #in~n;~r := #in~r; 12#L13true assume ~r > 0; 9#L14true call #t~ret0 := p(~m, ~r - 1, ~n);< 11#pENTRYtrue [2020-07-29 01:28:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,710 INFO L82 PathProgramCache]: Analyzing trace with hash 44796, now seen corresponding path program 1 times [2020-07-29 01:28:55,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,719 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587383168] [2020-07-29 01:28:55,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,802 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,829 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,831 INFO L82 PathProgramCache]: Analyzing trace with hash 29912, now seen corresponding path program 1 times [2020-07-29 01:28:55,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,831 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682705454] [2020-07-29 01:28:55,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:55,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1334517757, now seen corresponding path program 1 times [2020-07-29 01:28:55,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:55,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955554070] [2020-07-29 01:28:55,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:55,878 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:55,882 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:56,101 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:56,102 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:56,103 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:56,103 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:56,103 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:56,103 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,103 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:56,104 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:56,104 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration1_Loop [2020-07-29 01:28:56,104 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:56,105 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:56,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,407 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:56,408 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:56,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,419 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,431 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,432 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:56,464 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,465 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,494 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:56,497 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,498 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:56,526 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,526 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=0} Honda state: {p_#in~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:56,556 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,556 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,561 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,561 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:56,602 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:56,602 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:56,630 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:56,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:56,673 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:56,971 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:56,971 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:56,971 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:56,972 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:56,972 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:56,972 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:56,972 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:56,972 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:56,972 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration1_Loop [2020-07-29 01:28:56,973 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:56,973 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:56,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:56,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:57,203 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:57,209 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,225 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,225 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,229 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,229 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,338 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,340 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,340 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,395 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,395 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,437 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,442 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,444 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,489 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,491 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,491 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,491 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,491 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,492 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,493 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,493 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,495 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,530 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,536 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,581 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,584 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:57,585 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:57,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:28:57,620 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,633 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,635 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,665 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,668 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,668 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,669 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,699 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,701 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,746 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,749 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,752 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,783 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,784 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,784 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,786 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,821 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,822 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,822 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:57,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:57,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:57,854 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:57,854 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:57,855 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:28:57,858 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:28:57,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:57,870 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:57,910 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-29 01:28:57,910 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:57,914 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:57,915 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:57,915 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:57,916 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_#in~n + 1*p_#in~r f1 = 1*p_#in~r Supporting invariants [] Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:57,942 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:57,948 INFO L393 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;~r := #in~r;" "assume ~r > 0;" "call #t~ret0 := p(~m, ~r - 1, ~n);"< [2020-07-29 01:28:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,058 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {27#unseeded} is VALID [2020-07-29 01:28:58,059 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {27#unseeded} is VALID [2020-07-29 01:28:58,060 INFO L263 TraceCheckUtils]: 2: Hoare triple {27#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {27#unseeded} is VALID [2020-07-29 01:28:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:28:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:58,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:58,199 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:58,215 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:58,250 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:28:58,281 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:28:58,429 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#(and (>= oldRank1 (ite (> (+ |p_#in~n| |p_#in~r|) 0) (+ |p_#in~n| |p_#in~r|) |p_#in~r|)) (>= oldRank0 (ite (> (+ |p_#in~n| |p_#in~r|) 0) 1 0)))} ~m := #in~m;~n := #in~n;~r := #in~r; {52#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= 1 oldRank0) (<= (+ p_~n p_~r) oldRank1)))} is VALID [2020-07-29 01:28:58,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {52#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= 1 oldRank0) (<= (+ p_~n p_~r) oldRank1)))} assume ~r > 0; {56#(and (< 0 p_~r) (or (and (<= 0 oldRank0) (<= (+ p_~n p_~r) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= 1 oldRank0) (<= (+ p_~n p_~r) oldRank1))))} is VALID [2020-07-29 01:28:58,435 INFO L263 TraceCheckUtils]: 2: Hoare triple {56#(and (< 0 p_~r) (or (and (<= 0 oldRank0) (<= (+ p_~n p_~r) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= 1 oldRank0) (<= (+ p_~n p_~r) oldRank1))))} call #t~ret0 := p(~m, ~r - 1, ~n); {41#(or (and (> oldRank0 (ite (> (+ |p_#in~n| |p_#in~r|) 0) 1 0)) (>= oldRank0 0)) (and (>= oldRank1 0) (>= oldRank0 (ite (> (+ |p_#in~n| |p_#in~r|) 0) 1 0)) (> oldRank1 (ite (> (+ |p_#in~n| |p_#in~r|) 0) (+ |p_#in~n| |p_#in~r|) |p_#in~r|))) unseeded)} is VALID [2020-07-29 01:28:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:58,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:58,471 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:58,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:28:58,504 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 4 states. [2020-07-29 01:28:58,920 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 12 states. [2020-07-29 01:28:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:58,921 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2020-07-29 01:28:58,925 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:58,925 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,926 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:58,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-07-29 01:28:58,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:58,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:58,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:58,937 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states. [2020-07-29 01:28:58,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:58,942 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:58,942 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:58,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:58,944 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:58,945 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 01:28:58,946 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:58,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:28:58,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:28:58,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 47 letters. Loop has 47 letters. [2020-07-29 01:28:58,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 17 letters. Loop has 17 letters. [2020-07-29 01:28:58,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:58,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:58,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:58,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:58,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:58,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:58,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:58,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:58,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:58,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:58,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:58,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:58,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:58,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:58,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:28:58,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:58,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:58,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:58,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:28:58,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:58,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:58,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:58,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:58,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,971 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:58,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:28:58,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:58,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:58,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 3 letters. Loop has 6 letters. [2020-07-29 01:28:58,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:58,976 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 01:28:58,984 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:58,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 20 states and 23 transitions. [2020-07-29 01:28:58,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:28:58,992 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:28:58,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2020-07-29 01:28:58,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:58,993 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-07-29 01:28:59,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2020-07-29 01:28:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2020-07-29 01:28:59,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:59,023 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 23 transitions. Second operand 13 states. [2020-07-29 01:28:59,024 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 23 transitions. Second operand 13 states. [2020-07-29 01:28:59,027 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 13 states. [2020-07-29 01:28:59,031 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:59,035 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-29 01:28:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-29 01:28:59,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:59,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:59,038 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 20 states and 23 transitions. [2020-07-29 01:28:59,038 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 20 states and 23 transitions. [2020-07-29 01:28:59,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:59,044 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-29 01:28:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-29 01:28:59,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:59,046 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:59,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:28:59,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2020-07-29 01:28:59,049 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 01:28:59,049 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 01:28:59,049 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:59,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:28:59,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:59,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:59,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:59,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:28:59,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:28:59,051 INFO L794 eck$LassoCheckResult]: Stem: 130#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 131#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 127#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 133#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 135#L13 assume !(~r > 0); 129#L16 [2020-07-29 01:28:59,052 INFO L796 eck$LassoCheckResult]: Loop: 129#L16 assume ~n > 0; 124#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 126#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 136#L13 assume !(~r > 0); 129#L16 [2020-07-29 01:28:59,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,052 INFO L82 PathProgramCache]: Analyzing trace with hash 43048962, now seen corresponding path program 1 times [2020-07-29 01:28:59,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,053 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669380248] [2020-07-29 01:28:59,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,066 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,069 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1220476, now seen corresponding path program 1 times [2020-07-29 01:28:59,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,070 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549134758] [2020-07-29 01:28:59,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,076 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,080 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,082 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:59,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1891526915, now seen corresponding path program 1 times [2020-07-29 01:28:59,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:59,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813377581] [2020-07-29 01:28:59,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:59,110 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:59,114 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:59,239 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:59,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:59,240 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:59,240 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:59,240 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:59,240 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,240 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:59,240 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:59,240 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration2_Loop [2020-07-29 01:28:59,240 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:59,240 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:59,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:59,435 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:59,435 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:59,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,445 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,450 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,450 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:59,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,492 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,496 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,496 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:59,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,534 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,539 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,539 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:59,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,574 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,581 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:59,581 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=-7, p_~m=-7, p_~r=-7, p_#in~r=-7} Honda state: {p_#in~m=-7, p_~m=-7, p_~r=-7, p_#in~r=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:59,604 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:59,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:59,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:00,150 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:29:00,152 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:00,152 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:00,152 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:00,153 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:00,153 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:00,153 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,153 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:00,153 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:00,153 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration2_Loop [2020-07-29 01:29:00,153 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:00,153 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:00,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:00,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:00,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:00,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:00,389 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:00,389 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:00,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:00,395 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,396 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,396 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,400 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:00,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,433 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:00,437 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:00,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:00,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,487 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:00,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,488 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,489 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,489 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,489 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,491 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:00,494 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:00,517 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:00,517 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:00,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:00,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:00,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:00,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:00,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:00,521 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:00,525 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:29:00,526 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:00,527 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:00,528 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:00,528 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:00,528 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_~n) = 1*p_~n Supporting invariants [] [2020-07-29 01:29:00,552 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:00,558 INFO L393 LassoCheck]: Loop: "assume ~n > 0;" "call #t~ret1 := p(~r, ~n - 1, ~m);"< "~m := #in~m;~n := #in~n;~r := #in~r;" "assume !(~r > 0);" [2020-07-29 01:29:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,607 INFO L280 TraceCheckUtils]: 0: Hoare triple {285#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {285#unseeded} is VALID [2020-07-29 01:29:00,608 INFO L280 TraceCheckUtils]: 1: Hoare triple {285#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {285#unseeded} is VALID [2020-07-29 01:29:00,609 INFO L263 TraceCheckUtils]: 2: Hoare triple {285#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {285#unseeded} is VALID [2020-07-29 01:29:00,609 INFO L280 TraceCheckUtils]: 3: Hoare triple {285#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {285#unseeded} is VALID [2020-07-29 01:29:00,610 INFO L280 TraceCheckUtils]: 4: Hoare triple {285#unseeded} assume !(~r > 0); {285#unseeded} is VALID [2020-07-29 01:29:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:29:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:00,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:00,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {288#(>= oldRank0 p_~n)} assume ~n > 0; {315#(and (<= p_~n oldRank0) (< 0 p_~n))} is VALID [2020-07-29 01:29:00,815 INFO L263 TraceCheckUtils]: 1: Hoare triple {315#(and (<= p_~n oldRank0) (< 0 p_~n))} call #t~ret1 := p(~r, ~n - 1, ~m); {319#(and (<= 1 oldRank0) (<= (+ |p_#in~n| 1) oldRank0))} is VALID [2020-07-29 01:29:00,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {319#(and (<= 1 oldRank0) (<= (+ |p_#in~n| 1) oldRank0))} ~m := #in~m;~n := #in~n;~r := #in~r; {323#(and (<= (+ p_~n 1) oldRank0) (<= 1 oldRank0))} is VALID [2020-07-29 01:29:00,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {323#(and (<= (+ p_~n 1) oldRank0) (<= 1 oldRank0))} assume !(~r > 0); {298#(or (and (> oldRank0 p_~n) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:00,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:00,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:29:00,828 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:00,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,829 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-29 01:29:00,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2020-07-29 01:29:00,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 16 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 25 states and 30 transitions. Complement of second has 13 states. [2020-07-29 01:29:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:00,878 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:00,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:29:00,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:00,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2020-07-29 01:29:00,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:00,881 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 16 transitions. cyclomatic complexity: 5 [2020-07-29 01:29:00,884 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:00,884 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:29:00,885 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:29:00,885 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:00,886 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:00,887 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:00,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:00,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:00,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:29:00,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:00,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:00,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:29:00,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:00,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:00,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:29:00,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:29:00,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:00,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:00,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:29:00,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:00,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:00,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:00,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:29:00,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:00,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:00,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:00,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:00,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:00,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:00,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:00,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:00,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:00,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 16 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 30 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:00,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,909 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:29:00,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-29 01:29:00,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:29:00,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-29 01:29:00,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2020-07-29 01:29:00,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:00,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. cyclomatic complexity: 8 [2020-07-29 01:29:00,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:00,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 20 states and 24 transitions. [2020-07-29 01:29:00,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:29:00,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:29:00,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2020-07-29 01:29:00,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:00,916 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-07-29 01:29:00,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2020-07-29 01:29:00,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-07-29 01:29:00,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:00,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 24 transitions. Second operand 18 states. [2020-07-29 01:29:00,918 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 24 transitions. Second operand 18 states. [2020-07-29 01:29:00,918 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 18 states. [2020-07-29 01:29:00,919 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:00,922 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-07-29 01:29:00,922 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-29 01:29:00,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:00,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:00,923 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 20 states and 24 transitions. [2020-07-29 01:29:00,923 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 20 states and 24 transitions. [2020-07-29 01:29:00,923 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:00,927 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-07-29 01:29:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2020-07-29 01:29:00,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:00,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:00,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:00,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:29:00,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-07-29 01:29:00,930 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-29 01:29:00,930 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-07-29 01:29:00,930 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:29:00,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2020-07-29 01:29:00,931 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:00,931 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:00,931 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:00,932 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:00,932 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:00,932 INFO L794 eck$LassoCheckResult]: Stem: 378#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 379#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 373#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 381#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 383#L13 assume !(~r > 0); 376#L16 assume ~n > 0; 372#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 375#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 385#L13 assume ~r > 0; 370#L14 [2020-07-29 01:29:00,932 INFO L796 eck$LassoCheckResult]: Loop: 370#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 371#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 386#L13 assume ~r > 0; 370#L14 [2020-07-29 01:29:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1891526918, now seen corresponding path program 1 times [2020-07-29 01:29:00,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392980597] [2020-07-29 01:29:00,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,942 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,949 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:00,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,953 INFO L82 PathProgramCache]: Analyzing trace with hash 56702, now seen corresponding path program 2 times [2020-07-29 01:29:00,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158863465] [2020-07-29 01:29:00,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,960 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:00,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -507463707, now seen corresponding path program 1 times [2020-07-29 01:29:00,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:00,968 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919656054] [2020-07-29 01:29:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:00,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:01,016 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:01,020 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:01,125 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:01,125 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:01,125 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:01,125 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:01,125 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:01,126 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,126 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:01,126 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:01,126 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration3_Loop [2020-07-29 01:29:01,126 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:01,126 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:01,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:01,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:01,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:01,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:01,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:01,294 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:01,294 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:01,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,301 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,306 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,306 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=-8, p_~m=-8} Honda state: {p_#in~m=-8, p_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,333 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,333 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,336 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,362 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,362 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:01,388 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:01,388 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,411 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:01,412 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:01,442 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:01,442 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:13,494 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:29:13,497 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:13,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:13,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:13,498 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:13,498 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:13,498 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,498 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:13,498 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:13,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration3_Loop [2020-07-29 01:29:13,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:13,498 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:13,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:13,712 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:13,712 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:13,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,729 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,729 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,729 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,730 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,731 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,739 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,769 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,795 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,795 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,797 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,854 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,854 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:13,856 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:13,857 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:29:13,885 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,890 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:13,892 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:13,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,927 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:13,927 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:13,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,955 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,956 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,956 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:13,956 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:13,957 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:13,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:13,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:13,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:13,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:13,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:13,985 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:13,986 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:13,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:13,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:14,014 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:14,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:14,016 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:14,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:14,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:14,016 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:14,018 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:14,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:14,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:14,030 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:29:14,031 INFO L444 ModelExtractionUtils]: 6 out of 11 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:14,033 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:14,033 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:14,033 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:14,034 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~r + 1*p_~n f1 = 1*p_~n Supporting invariants [] [2020-07-29 01:29:14,057 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:14,060 INFO L393 LassoCheck]: Loop: "call #t~ret0 := p(~m, ~r - 1, ~n);"< "~m := #in~m;~n := #in~n;~r := #in~r;" "assume ~r > 0;" [2020-07-29 01:29:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:14,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {544#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {544#unseeded} is VALID [2020-07-29 01:29:14,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {544#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {544#unseeded} is VALID [2020-07-29 01:29:14,133 INFO L263 TraceCheckUtils]: 2: Hoare triple {544#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {544#unseeded} is VALID [2020-07-29 01:29:14,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {544#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {544#unseeded} is VALID [2020-07-29 01:29:14,138 INFO L280 TraceCheckUtils]: 4: Hoare triple {544#unseeded} assume !(~r > 0); {544#unseeded} is VALID [2020-07-29 01:29:14,139 INFO L280 TraceCheckUtils]: 5: Hoare triple {544#unseeded} assume ~n > 0; {544#unseeded} is VALID [2020-07-29 01:29:14,140 INFO L263 TraceCheckUtils]: 6: Hoare triple {544#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {544#unseeded} is VALID [2020-07-29 01:29:14,141 INFO L280 TraceCheckUtils]: 7: Hoare triple {544#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {544#unseeded} is VALID [2020-07-29 01:29:14,141 INFO L280 TraceCheckUtils]: 8: Hoare triple {544#unseeded} assume ~r > 0; {544#unseeded} is VALID [2020-07-29 01:29:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:29:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:14,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:26,353 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,392 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,446 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:26,464 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:29:26,503 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:29:26,538 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,600 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,627 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,725 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,770 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:26,831 INFO L263 TraceCheckUtils]: 0: Hoare triple {549#(and (>= oldRank1 (ite (> (+ p_~r p_~n) 0) (+ p_~r p_~n) p_~n)) (>= oldRank0 (ite (> (+ p_~r p_~n) 0) 1 0)))} call #t~ret0 := p(~m, ~r - 1, ~n); {587#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:26,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} ~m := #in~m;~n := #in~n;~r := #in~r; {591#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:26,834 INFO L280 TraceCheckUtils]: 2: Hoare triple {591#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} assume ~r > 0; {558#(or (and (> oldRank1 (ite (> (+ p_~r p_~n) 0) (+ p_~r p_~n) p_~n)) (>= oldRank1 0) (>= oldRank0 (ite (> (+ p_~r p_~n) 0) 1 0))) (and (>= oldRank0 0) (> oldRank0 (ite (> (+ p_~r p_~n) 0) 1 0))) unseeded)} is VALID [2020-07-29 01:29:26,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:26,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:26,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:26,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:26,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:26,857 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:26,857 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:29:27,048 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 22 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 42 states and 50 transitions. Complement of second has 9 states. [2020-07-29 01:29:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:27,049 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:27,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:27,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:27,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:27,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 50 transitions. [2020-07-29 01:29:27,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:27,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,053 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 7 [2020-07-29 01:29:27,055 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:27,055 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:27,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:27,056 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:27,056 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 50 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:27,058 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:27,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:27,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:27,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:29:27,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:27,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:27,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:29:27,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:27,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:27,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:27,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:27,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:27,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:27,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:27,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:27,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:27,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:29:27,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:27,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:27,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:29:27,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:27,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:27,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:27,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:27,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:27,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:27,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:27,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:27,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:27,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 50 transitions. cyclomatic complexity: 13 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,082 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:29:27,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:29:27,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:27,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:29:27,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:27,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. cyclomatic complexity: 13 [2020-07-29 01:29:27,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:27,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 36 states and 44 transitions. [2020-07-29 01:29:27,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-07-29 01:29:27,090 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-29 01:29:27,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 44 transitions. [2020-07-29 01:29:27,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:29:27,091 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 44 transitions. [2020-07-29 01:29:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 44 transitions. [2020-07-29 01:29:27,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2020-07-29 01:29:27,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:29:27,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 44 transitions. Second operand 31 states. [2020-07-29 01:29:27,094 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 44 transitions. Second operand 31 states. [2020-07-29 01:29:27,095 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand 31 states. [2020-07-29 01:29:27,095 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,103 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2020-07-29 01:29:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 60 transitions. [2020-07-29 01:29:27,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,105 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 36 states and 44 transitions. [2020-07-29 01:29:27,105 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 36 states and 44 transitions. [2020-07-29 01:29:27,106 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:29:27,111 INFO L93 Difference]: Finished difference Result 67 states and 80 transitions. [2020-07-29 01:29:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2020-07-29 01:29:27,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:29:27,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:29:27,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:29:27,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:29:27,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 01:29:27,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2020-07-29 01:29:27,115 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 01:29:27,115 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2020-07-29 01:29:27,115 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:29:27,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2020-07-29 01:29:27,116 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:27,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:27,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:27,116 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:29:27,116 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:29:27,117 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 661#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 662#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 665#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 666#L13 assume ~r > 0; 656#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 664#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 680#L13 assume !(~r > 0); 658#L16 assume ~n > 0; 655#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 657#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 670#L13 assume ~r > 0; 654#L14 [2020-07-29 01:29:27,117 INFO L796 eck$LassoCheckResult]: Loop: 654#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 653#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 678#L13 assume ~r > 0; 654#L14 [2020-07-29 01:29:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1683587899, now seen corresponding path program 2 times [2020-07-29 01:29:27,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591535162] [2020-07-29 01:29:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,127 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,135 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,138 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,139 INFO L82 PathProgramCache]: Analyzing trace with hash 56702, now seen corresponding path program 3 times [2020-07-29 01:29:27,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271013398] [2020-07-29 01:29:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,142 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,145 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,146 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:27,147 INFO L82 PathProgramCache]: Analyzing trace with hash -860956668, now seen corresponding path program 3 times [2020-07-29 01:29:27,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:29:27,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698086123] [2020-07-29 01:29:27,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:29:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,158 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:29:27,168 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:29:27,171 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:29:27,268 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:27,268 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:27,268 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:27,268 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:27,268 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:29:27,269 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,269 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:27,269 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:27,269 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration4_Loop [2020-07-29 01:29:27,269 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:27,269 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:27,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:27,426 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:27,426 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,429 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,429 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,433 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,433 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,455 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,455 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,459 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,459 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret1=0} Honda state: {p_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:27,496 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:29:27,496 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=-8, p_~m=-8} Honda state: {p_#in~m=-8, p_~m=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:29:27,520 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:27,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:29:27,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:29:39,611 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:29:39,614 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:29:39,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:29:39,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:29:39,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:29:39,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:29:39,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:29:39,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:29:39,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration4_Loop [2020-07-29 01:29:39,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:29:39,615 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:29:39,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:29:39,777 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:29:39,777 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,791 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,819 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,822 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,886 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,913 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,915 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,915 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,915 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:29:39,915 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:29:39,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-07-29 01:29:39,938 INFO L489 LassoAnalysis]: Using template '2-nested'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,940 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,942 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:39,942 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:39,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:39,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:39,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:39,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:39,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:39,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:39,971 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:39,973 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:39,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:39,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:40,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:40,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:40,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:40,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:40,002 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:40,002 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:40,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:29:40,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:40,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:29:40,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:29:40,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:29:40,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:29:40,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:29:40,035 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2020-07-29 01:29:40,037 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2020-07-29 01:29:40,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,043 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:29:40,056 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-07-29 01:29:40,056 INFO L444 ModelExtractionUtils]: 5 out of 11 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:29:40,064 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:29:40,064 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:29:40,064 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:29:40,064 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-nested ranking function: f0 = 1*p_~n + 1*p_~r f1 = 1*p_~n Supporting invariants [] Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:29:40,092 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:29:40,095 INFO L393 LassoCheck]: Loop: "call #t~ret0 := p(~m, ~r - 1, ~n);"< "~m := #in~m;~n := #in~n;~r := #in~r;" "assume ~r > 0;" [2020-07-29 01:29:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:40,182 INFO L280 TraceCheckUtils]: 0: Hoare triple {920#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {920#unseeded} is VALID [2020-07-29 01:29:40,183 INFO L280 TraceCheckUtils]: 1: Hoare triple {920#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {920#unseeded} is VALID [2020-07-29 01:29:40,184 INFO L263 TraceCheckUtils]: 2: Hoare triple {920#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {920#unseeded} is VALID [2020-07-29 01:29:40,185 INFO L280 TraceCheckUtils]: 3: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:40,185 INFO L280 TraceCheckUtils]: 4: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:29:40,187 INFO L263 TraceCheckUtils]: 5: Hoare triple {920#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {920#unseeded} is VALID [2020-07-29 01:29:40,188 INFO L280 TraceCheckUtils]: 6: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:40,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {920#unseeded} assume !(~r > 0); {920#unseeded} is VALID [2020-07-29 01:29:40,189 INFO L280 TraceCheckUtils]: 8: Hoare triple {920#unseeded} assume ~n > 0; {920#unseeded} is VALID [2020-07-29 01:29:40,190 INFO L263 TraceCheckUtils]: 9: Hoare triple {920#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {920#unseeded} is VALID [2020-07-29 01:29:40,191 INFO L280 TraceCheckUtils]: 10: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:40,191 INFO L280 TraceCheckUtils]: 11: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:29:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:29:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:40,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:52,385 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,430 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,479 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:52,498 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:52,540 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:29:52,564 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,619 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,650 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,757 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,789 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:29:52,866 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#(and (>= oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)))} call #t~ret0 := p(~m, ~r - 1, ~n); {972#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:52,867 INFO L280 TraceCheckUtils]: 1: Hoare triple {972#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} ~m := #in~m;~n := #in~n;~r := #in~r; {976#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:29:52,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {976#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} assume ~r > 0; {934#(or (and (>= oldRank1 0) (> oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0))) (and (> oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:29:52,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:29:52,869 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:29:52,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:29:52,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:52,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:52,889 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:29:52,889 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:29:53,082 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 9 states. [2020-07-29 01:29:53,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:29:53,083 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:53,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:29:53,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:53,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2020-07-29 01:29:53,085 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:29:53,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:29:53,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:29:53,086 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:29:53,087 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:53,087 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:29:53,088 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:29:53,088 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:29:53,088 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 60 transitions. cyclomatic complexity: 17 [2020-07-29 01:29:53,089 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:29:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:53,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:53,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:29:53,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:29:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:53,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:29:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:29:53,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:53,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:29:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:29:53,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:29:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:29:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:29:53,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:29:53,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,102 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:29:53,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:29:53,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:29:53,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:29:53,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:29:53,104 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:29:53,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:29:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:29:53,176 INFO L280 TraceCheckUtils]: 0: Hoare triple {920#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {920#unseeded} is VALID [2020-07-29 01:29:53,177 INFO L280 TraceCheckUtils]: 1: Hoare triple {920#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {920#unseeded} is VALID [2020-07-29 01:29:53,178 INFO L263 TraceCheckUtils]: 2: Hoare triple {920#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {920#unseeded} is VALID [2020-07-29 01:29:53,178 INFO L280 TraceCheckUtils]: 3: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:53,179 INFO L280 TraceCheckUtils]: 4: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:29:53,179 INFO L263 TraceCheckUtils]: 5: Hoare triple {920#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {920#unseeded} is VALID [2020-07-29 01:29:53,180 INFO L280 TraceCheckUtils]: 6: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:53,181 INFO L280 TraceCheckUtils]: 7: Hoare triple {920#unseeded} assume !(~r > 0); {920#unseeded} is VALID [2020-07-29 01:29:53,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {920#unseeded} assume ~n > 0; {920#unseeded} is VALID [2020-07-29 01:29:53,184 INFO L263 TraceCheckUtils]: 9: Hoare triple {920#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {920#unseeded} is VALID [2020-07-29 01:29:53,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:29:53,188 INFO L280 TraceCheckUtils]: 11: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:29:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:29:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:29:53,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,343 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,384 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,446 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:30:05,461 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:30:05,502 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:30:05,523 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,565 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,593 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,680 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,712 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:05,777 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#(and (>= oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)))} call #t~ret0 := p(~m, ~r - 1, ~n); {1078#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:30:05,778 INFO L280 TraceCheckUtils]: 1: Hoare triple {1078#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} ~m := #in~m;~n := #in~n;~r := #in~r; {1082#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:30:05,779 INFO L280 TraceCheckUtils]: 2: Hoare triple {1082#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} assume ~r > 0; {934#(or (and (>= oldRank1 0) (> oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0))) (and (> oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:05,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:05,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:05,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:05,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,798 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:05,799 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:30:05,975 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 48 states and 60 transitions. Complement of second has 9 states. [2020-07-29 01:30:05,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:05,976 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:05,976 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,976 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:05,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:05,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 60 transitions. [2020-07-29 01:30:05,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:30:05,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,980 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:05,980 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:30:05,980 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:05,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:05,981 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:05,981 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 60 transitions. cyclomatic complexity: 17 [2020-07-29 01:30:05,983 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:30:05,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:05,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:05,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:05,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:05,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:05,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:05,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:05,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:05,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:05,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:05,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:05,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:05,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:05,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:05,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:05,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:05,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:05,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:05,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:05,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:05,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 60 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,997 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:30:05,998 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:05,998 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,999 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:06,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,062 INFO L280 TraceCheckUtils]: 0: Hoare triple {920#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {920#unseeded} is VALID [2020-07-29 01:30:06,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {920#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {920#unseeded} is VALID [2020-07-29 01:30:06,064 INFO L263 TraceCheckUtils]: 2: Hoare triple {920#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {920#unseeded} is VALID [2020-07-29 01:30:06,065 INFO L280 TraceCheckUtils]: 3: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:30:06,067 INFO L280 TraceCheckUtils]: 4: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:30:06,067 INFO L263 TraceCheckUtils]: 5: Hoare triple {920#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {920#unseeded} is VALID [2020-07-29 01:30:06,068 INFO L280 TraceCheckUtils]: 6: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:30:06,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {920#unseeded} assume !(~r > 0); {920#unseeded} is VALID [2020-07-29 01:30:06,069 INFO L280 TraceCheckUtils]: 8: Hoare triple {920#unseeded} assume ~n > 0; {920#unseeded} is VALID [2020-07-29 01:30:06,070 INFO L263 TraceCheckUtils]: 9: Hoare triple {920#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {920#unseeded} is VALID [2020-07-29 01:30:06,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {920#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {920#unseeded} is VALID [2020-07-29 01:30:06,070 INFO L280 TraceCheckUtils]: 11: Hoare triple {920#unseeded} assume ~r > 0; {920#unseeded} is VALID [2020-07-29 01:30:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:18,207 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,246 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,282 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:30:18,297 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-29 01:30:18,330 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-29 01:30:18,347 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,398 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,419 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,520 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,547 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:30:18,617 INFO L263 TraceCheckUtils]: 0: Hoare triple {925#(and (>= oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)))} call #t~ret0 := p(~m, ~r - 1, ~n); {1184#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:30:18,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {1184#(or (and (<= 0 oldRank0) (<= |p_#in~r| oldRank1) (<= (+ |p_#in~n| |p_#in~r| 1) 0)) (and (<= (+ |p_#in~n| |p_#in~r| 1) oldRank1) (<= 1 oldRank1) (<= 1 oldRank0)))} ~m := #in~m;~n := #in~n;~r := #in~r; {1188#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} is VALID [2020-07-29 01:30:18,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {1188#(or (and (<= 0 oldRank0) (<= (+ p_~n p_~r 1) 0) (<= p_~r oldRank1)) (and (<= 1 oldRank1) (<= (+ p_~n p_~r 1) oldRank1) (<= 1 oldRank0)))} assume ~r > 0; {934#(or (and (>= oldRank1 0) (> oldRank1 (ite (> (+ p_~n p_~r) 0) (+ p_~n p_~r) p_~n)) (>= oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0))) (and (> oldRank0 (ite (> (+ p_~n p_~r) 0) 1 0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:18,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:18,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:18,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:18,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,635 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:18,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12 Second operand 4 states. [2020-07-29 01:30:18,839 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 38 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 8 states. [2020-07-29 01:30:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:18,840 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:18,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:18,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:18,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:18,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 68 transitions. [2020-07-29 01:30:18,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:30:18,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 38 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:18,843 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:30:18,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:18,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:18,844 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:18,844 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 68 transitions. cyclomatic complexity: 20 [2020-07-29 01:30:18,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:30:18,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:30:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:30:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:30:18,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:30:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:18,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:18,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:30:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:18,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:30:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:18,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:30:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:30:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 7 letters. [2020-07-29 01:30:18,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 7 letters. [2020-07-29 01:30:18,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:18,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:18,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:30:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:30:18,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:30:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 38 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 7 letters. [2020-07-29 01:30:18,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,862 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:30:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:30:18,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:30:18,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:30:18,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:18,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. cyclomatic complexity: 20 [2020-07-29 01:30:18,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:30:18,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 41 states and 51 transitions. [2020-07-29 01:30:18,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:30:18,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-07-29 01:30:18,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2020-07-29 01:30:18,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:18,870 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-07-29 01:30:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2020-07-29 01:30:18,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 24. [2020-07-29 01:30:18,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:18,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states and 51 transitions. Second operand 24 states. [2020-07-29 01:30:18,872 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states and 51 transitions. Second operand 24 states. [2020-07-29 01:30:18,873 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 24 states. [2020-07-29 01:30:18,873 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:18,877 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2020-07-29 01:30:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-07-29 01:30:18,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:18,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:18,878 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 41 states and 51 transitions. [2020-07-29 01:30:18,878 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 41 states and 51 transitions. [2020-07-29 01:30:18,879 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:18,884 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2020-07-29 01:30:18,885 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2020-07-29 01:30:18,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:18,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:18,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:18,886 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:30:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-29 01:30:18,887 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 01:30:18,888 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-29 01:30:18,888 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:30:18,888 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-07-29 01:30:18,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:30:18,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:18,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:18,889 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:18,889 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:30:18,889 INFO L794 eck$LassoCheckResult]: Stem: 1267#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 1268#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 1262#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 1275#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1273#L13 assume !(~r > 0); 1265#L16 assume ~n > 0; 1261#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1263#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1277#L13 assume ~r > 0; 1258#L14 [2020-07-29 01:30:18,890 INFO L796 eck$LassoCheckResult]: Loop: 1258#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 1270#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1278#L13 assume !(~r > 0); 1276#L16 assume ~n > 0; 1257#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 1260#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 1279#L13 assume ~r > 0; 1258#L14 [2020-07-29 01:30:18,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:18,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1891526918, now seen corresponding path program 2 times [2020-07-29 01:30:18,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:18,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005880270] [2020-07-29 01:30:18,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:18,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:18,902 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:18,904 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:18,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:18,905 INFO L82 PathProgramCache]: Analyzing trace with hash 828947705, now seen corresponding path program 1 times [2020-07-29 01:30:18,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:18,905 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856081445] [2020-07-29 01:30:18,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:18,910 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:18,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:18,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:18,916 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:18,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:18,916 INFO L82 PathProgramCache]: Analyzing trace with hash 559352800, now seen corresponding path program 4 times [2020-07-29 01:30:18,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:18,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853109121] [2020-07-29 01:30:18,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,012 INFO L280 TraceCheckUtils]: 0: Hoare triple {1527#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {1527#true} is VALID [2020-07-29 01:30:19,013 INFO L280 TraceCheckUtils]: 1: Hoare triple {1527#true} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {1527#true} is VALID [2020-07-29 01:30:19,013 INFO L263 TraceCheckUtils]: 2: Hoare triple {1527#true} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {1527#true} is VALID [2020-07-29 01:30:19,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {1527#true} ~m := #in~m;~n := #in~n;~r := #in~r; {1527#true} is VALID [2020-07-29 01:30:19,014 INFO L280 TraceCheckUtils]: 4: Hoare triple {1527#true} assume !(~r > 0); {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {1529#(<= p_~r 0)} assume ~n > 0; {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,016 INFO L263 TraceCheckUtils]: 6: Hoare triple {1529#(<= p_~r 0)} call #t~ret1 := p(~r, ~n - 1, ~m); {1530#(<= |p_#in~m| 0)} is VALID [2020-07-29 01:30:19,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {1530#(<= |p_#in~m| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,017 INFO L280 TraceCheckUtils]: 8: Hoare triple {1531#(<= p_~m 0)} assume ~r > 0; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,018 INFO L263 TraceCheckUtils]: 9: Hoare triple {1531#(<= p_~m 0)} call #t~ret0 := p(~m, ~r - 1, ~n); {1530#(<= |p_#in~m| 0)} is VALID [2020-07-29 01:30:19,020 INFO L280 TraceCheckUtils]: 10: Hoare triple {1530#(<= |p_#in~m| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,024 INFO L280 TraceCheckUtils]: 11: Hoare triple {1531#(<= p_~m 0)} assume !(~r > 0); {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,028 INFO L280 TraceCheckUtils]: 12: Hoare triple {1531#(<= p_~m 0)} assume ~n > 0; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,030 INFO L263 TraceCheckUtils]: 13: Hoare triple {1531#(<= p_~m 0)} call #t~ret1 := p(~r, ~n - 1, ~m); {1532#(<= |p_#in~r| 0)} is VALID [2020-07-29 01:30:19,031 INFO L280 TraceCheckUtils]: 14: Hoare triple {1532#(<= |p_#in~r| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,031 INFO L280 TraceCheckUtils]: 15: Hoare triple {1529#(<= p_~r 0)} assume ~r > 0; {1528#false} is VALID [2020-07-29 01:30:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:19,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853109121] [2020-07-29 01:30:19,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418557380] [2020-07-29 01:30:19,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:30:19,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:30:19,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:30:19,066 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:19,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:19,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {1527#true} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {1527#true} is VALID [2020-07-29 01:30:19,217 INFO L280 TraceCheckUtils]: 1: Hoare triple {1527#true} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {1527#true} is VALID [2020-07-29 01:30:19,217 INFO L263 TraceCheckUtils]: 2: Hoare triple {1527#true} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {1527#true} is VALID [2020-07-29 01:30:19,218 INFO L280 TraceCheckUtils]: 3: Hoare triple {1527#true} ~m := #in~m;~n := #in~n;~r := #in~r; {1527#true} is VALID [2020-07-29 01:30:19,220 INFO L280 TraceCheckUtils]: 4: Hoare triple {1527#true} assume !(~r > 0); {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,221 INFO L280 TraceCheckUtils]: 5: Hoare triple {1529#(<= p_~r 0)} assume ~n > 0; {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,222 INFO L263 TraceCheckUtils]: 6: Hoare triple {1529#(<= p_~r 0)} call #t~ret1 := p(~r, ~n - 1, ~m); {1530#(<= |p_#in~m| 0)} is VALID [2020-07-29 01:30:19,222 INFO L280 TraceCheckUtils]: 7: Hoare triple {1530#(<= |p_#in~m| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,223 INFO L280 TraceCheckUtils]: 8: Hoare triple {1531#(<= p_~m 0)} assume ~r > 0; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,224 INFO L263 TraceCheckUtils]: 9: Hoare triple {1531#(<= p_~m 0)} call #t~ret0 := p(~m, ~r - 1, ~n); {1530#(<= |p_#in~m| 0)} is VALID [2020-07-29 01:30:19,225 INFO L280 TraceCheckUtils]: 10: Hoare triple {1530#(<= |p_#in~m| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,225 INFO L280 TraceCheckUtils]: 11: Hoare triple {1531#(<= p_~m 0)} assume !(~r > 0); {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,226 INFO L280 TraceCheckUtils]: 12: Hoare triple {1531#(<= p_~m 0)} assume ~n > 0; {1531#(<= p_~m 0)} is VALID [2020-07-29 01:30:19,227 INFO L263 TraceCheckUtils]: 13: Hoare triple {1531#(<= p_~m 0)} call #t~ret1 := p(~r, ~n - 1, ~m); {1532#(<= |p_#in~r| 0)} is VALID [2020-07-29 01:30:19,227 INFO L280 TraceCheckUtils]: 14: Hoare triple {1532#(<= |p_#in~r| 0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1529#(<= p_~r 0)} is VALID [2020-07-29 01:30:19,228 INFO L280 TraceCheckUtils]: 15: Hoare triple {1529#(<= p_~r 0)} assume ~r > 0; {1528#false} is VALID [2020-07-29 01:30:19,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:30:19,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:30:19,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:30:19,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824522754] [2020-07-29 01:30:19,514 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:19,514 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:19,514 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:19,514 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:19,514 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:19,514 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:19,514 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:19,514 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:19,514 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration5_Loop [2020-07-29 01:30:19,515 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:19,515 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:19,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:19,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:19,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:19,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:19,689 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:19,689 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:19,693 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:19,693 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:19,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:19,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:27,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:27,052 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:27,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:27,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:27,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:27,052 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:27,052 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:27,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:27,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration5_Loop [2020-07-29 01:30:27,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:27,053 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:27,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:27,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:27,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:27,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:27,246 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:27,246 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,249 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:27,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:27,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:27,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:27,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:27,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:27,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:27,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:27,252 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,280 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:27,281 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:27,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:27,282 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:27,282 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:27,282 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:27,282 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:27,282 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:27,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:27,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:27,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:27,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:27,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:27,314 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:27,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:27,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:27,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:27,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:27,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:27,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:27,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:27,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:27,344 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:27,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:27,349 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:27,354 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:27,354 INFO L444 ModelExtractionUtils]: 5 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:27,359 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:27,359 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:27,359 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:27,359 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_~m) = 1*p_~m Supporting invariants [] [2020-07-29 01:30:27,382 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:27,385 INFO L393 LassoCheck]: Loop: "call #t~ret0 := p(~m, ~r - 1, ~n);"< "~m := #in~m;~n := #in~n;~r := #in~r;" "assume !(~r > 0);" "assume ~n > 0;" "call #t~ret1 := p(~r, ~n - 1, ~m);"< "~m := #in~m;~n := #in~n;~r := #in~r;" "assume ~r > 0;" [2020-07-29 01:30:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:27,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:30:27,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:27,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:27,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {1578#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {1578#unseeded} is VALID [2020-07-29 01:30:27,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {1578#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {1578#unseeded} is VALID [2020-07-29 01:30:27,441 INFO L263 TraceCheckUtils]: 2: Hoare triple {1578#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {1578#unseeded} is VALID [2020-07-29 01:30:27,444 INFO L280 TraceCheckUtils]: 3: Hoare triple {1578#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {1578#unseeded} is VALID [2020-07-29 01:30:27,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {1578#unseeded} assume !(~r > 0); {1578#unseeded} is VALID [2020-07-29 01:30:27,447 INFO L280 TraceCheckUtils]: 5: Hoare triple {1578#unseeded} assume ~n > 0; {1578#unseeded} is VALID [2020-07-29 01:30:27,448 INFO L263 TraceCheckUtils]: 6: Hoare triple {1578#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {1578#unseeded} is VALID [2020-07-29 01:30:27,448 INFO L280 TraceCheckUtils]: 7: Hoare triple {1578#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {1578#unseeded} is VALID [2020-07-29 01:30:27,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {1578#unseeded} assume ~r > 0; {1578#unseeded} is VALID [2020-07-29 01:30:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:27,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-29 01:30:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:27,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:27,733 INFO L263 TraceCheckUtils]: 0: Hoare triple {1581#(>= oldRank0 p_~m)} call #t~ret0 := p(~m, ~r - 1, ~n); {1620#(<= |p_#in~m| oldRank0)} is VALID [2020-07-29 01:30:27,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {1620#(<= |p_#in~m| oldRank0)} ~m := #in~m;~n := #in~n;~r := #in~r; {1581#(>= oldRank0 p_~m)} is VALID [2020-07-29 01:30:27,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {1581#(>= oldRank0 p_~m)} assume !(~r > 0); {1627#(and (<= p_~r 0) (<= p_~m oldRank0))} is VALID [2020-07-29 01:30:27,736 INFO L280 TraceCheckUtils]: 3: Hoare triple {1627#(and (<= p_~r 0) (<= p_~m oldRank0))} assume ~n > 0; {1627#(and (<= p_~r 0) (<= p_~m oldRank0))} is VALID [2020-07-29 01:30:27,738 INFO L263 TraceCheckUtils]: 4: Hoare triple {1627#(and (<= p_~r 0) (<= p_~m oldRank0))} call #t~ret1 := p(~r, ~n - 1, ~m); {1634#(and (<= |p_#in~m| 0) (<= |p_#in~r| oldRank0))} is VALID [2020-07-29 01:30:27,739 INFO L280 TraceCheckUtils]: 5: Hoare triple {1634#(and (<= |p_#in~m| 0) (<= |p_#in~r| oldRank0))} ~m := #in~m;~n := #in~n;~r := #in~r; {1638#(and (<= p_~r oldRank0) (<= p_~m 0))} is VALID [2020-07-29 01:30:27,740 INFO L280 TraceCheckUtils]: 6: Hoare triple {1638#(and (<= p_~r oldRank0) (<= p_~m 0))} assume ~r > 0; {1591#(or (and (>= oldRank0 0) (> oldRank0 p_~m)) unseeded)} is VALID [2020-07-29 01:30:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:27,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:30:27,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:27,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:27,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:27,775 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2020-07-29 01:30:27,775 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 7 states. [2020-07-29 01:30:28,022 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 104 states and 131 transitions. Complement of second has 26 states. [2020-07-29 01:30:28,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:28,022 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:28,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:28,023 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:28,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:28,023 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:30:28,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:28,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:28,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:28,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 131 transitions. [2020-07-29 01:30:28,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:30:28,027 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:28,027 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:28,027 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:28,028 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:30:28,029 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:30:28,029 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:30:28,030 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:28,030 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 104 states and 131 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:28,032 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 13 examples of accepted words. [2020-07-29 01:30:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:28,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:28,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 104 letters. Loop has 104 letters. [2020-07-29 01:30:28,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:28,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:28,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:28,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:28,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:28,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:28,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:28,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:28,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 10 letters. Loop has 7 letters. [2020-07-29 01:30:28,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:28,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:28,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:28,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:28,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:28,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:28,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:28,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:28,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:28,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:28,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:28,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 11 letters. Loop has 7 letters. [2020-07-29 01:30:28,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:28,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:28,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:28,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:30:28,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:30:28,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:30:28,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 8 letters. [2020-07-29 01:30:28,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 13 letters. Loop has 11 letters. [2020-07-29 01:30:28,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 16 letters. Loop has 11 letters. [2020-07-29 01:30:28,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:30:28,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:30:28,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 17 letters. Loop has 8 letters. [2020-07-29 01:30:28,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:30:28,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:30:28,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 18 letters. Loop has 8 letters. [2020-07-29 01:30:28,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:30:28,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:30:28,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 11 letters. [2020-07-29 01:30:28,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:30:28,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:30:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 19 letters. Loop has 8 letters. [2020-07-29 01:30:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:28,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 14 letters. Loop has 8 letters. [2020-07-29 01:30:28,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:30:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:30:28,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 20 letters. Loop has 8 letters. [2020-07-29 01:30:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:30:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:30:28,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 21 letters. Loop has 8 letters. [2020-07-29 01:30:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 11 letters. [2020-07-29 01:30:28,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 11 letters. [2020-07-29 01:30:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 11 letters. [2020-07-29 01:30:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 30 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:28,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:28,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 104 states and 131 transitions. cyclomatic complexity: 34 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:30:28,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,060 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-29 01:30:28,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 7 letters. [2020-07-29 01:30:28,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 7 letters. [2020-07-29 01:30:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 9 letters. Loop has 14 letters. [2020-07-29 01:30:28,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:28,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 131 transitions. cyclomatic complexity: 34 [2020-07-29 01:30:28,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2020-07-29 01:30:28,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 104 states and 131 transitions. [2020-07-29 01:30:28,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2020-07-29 01:30:28,075 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2020-07-29 01:30:28,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 131 transitions. [2020-07-29 01:30:28,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:28,076 INFO L688 BuchiCegarLoop]: Abstraction has 104 states and 131 transitions. [2020-07-29 01:30:28,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states and 131 transitions. [2020-07-29 01:30:28,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2020-07-29 01:30:28,082 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:28,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states and 131 transitions. Second operand 59 states. [2020-07-29 01:30:28,082 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states and 131 transitions. Second operand 59 states. [2020-07-29 01:30:28,082 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 59 states. [2020-07-29 01:30:28,083 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:28,091 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2020-07-29 01:30:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 168 transitions. [2020-07-29 01:30:28,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:28,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:28,094 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 104 states and 131 transitions. [2020-07-29 01:30:28,094 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 104 states and 131 transitions. [2020-07-29 01:30:28,095 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:28,106 INFO L93 Difference]: Finished difference Result 200 states and 256 transitions. [2020-07-29 01:30:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 256 transitions. [2020-07-29 01:30:28,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:28,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:28,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:28,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-29 01:30:28,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 79 transitions. [2020-07-29 01:30:28,112 INFO L711 BuchiCegarLoop]: Abstraction has 59 states and 79 transitions. [2020-07-29 01:30:28,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:28,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:30:28,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:30:28,116 INFO L87 Difference]: Start difference. First operand 59 states and 79 transitions. Second operand 6 states. [2020-07-29 01:30:28,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:28,269 INFO L93 Difference]: Finished difference Result 79 states and 95 transitions. [2020-07-29 01:30:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:30:28,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:30:28,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:28,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 95 transitions. [2020-07-29 01:30:28,298 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:30:28,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 37 states and 43 transitions. [2020-07-29 01:30:28,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-07-29 01:30:28,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-07-29 01:30:28,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2020-07-29 01:30:28,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:28,300 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2020-07-29 01:30:28,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2020-07-29 01:30:28,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2020-07-29 01:30:28,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:28,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states and 43 transitions. Second operand 24 states. [2020-07-29 01:30:28,303 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states and 43 transitions. Second operand 24 states. [2020-07-29 01:30:28,304 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 24 states. [2020-07-29 01:30:28,304 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:28,306 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-07-29 01:30:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2020-07-29 01:30:28,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:28,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:28,309 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 37 states and 43 transitions. [2020-07-29 01:30:28,309 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 37 states and 43 transitions. [2020-07-29 01:30:28,310 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:28,312 INFO L93 Difference]: Finished difference Result 62 states and 71 transitions. [2020-07-29 01:30:28,313 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2020-07-29 01:30:28,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:28,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:28,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:28,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:28,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:30:28,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2020-07-29 01:30:28,315 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:30:28,315 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-07-29 01:30:28,315 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:30:28,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2020-07-29 01:30:28,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:28,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:28,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:28,316 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:28,316 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:30:28,317 INFO L794 eck$LassoCheckResult]: Stem: 2442#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 2443#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 2444#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 2449#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2455#L13 assume !(~r > 0); 2454#L16 assume ~n > 0; 2445#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 2453#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2452#L13 assume ~r > 0; 2435#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 2436#pENTRY [2020-07-29 01:30:28,317 INFO L796 eck$LassoCheckResult]: Loop: 2436#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2446#L13 assume !(~r > 0); 2440#L16 assume ~n > 0; 2433#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 2436#pENTRY [2020-07-29 01:30:28,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:28,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1492207714, now seen corresponding path program 5 times [2020-07-29 01:30:28,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:28,318 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398049019] [2020-07-29 01:30:28,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,342 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,363 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:28,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 929596, now seen corresponding path program 2 times [2020-07-29 01:30:28,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:28,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929034962] [2020-07-29 01:30:28,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,372 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,377 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:28,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:28,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1953652509, now seen corresponding path program 6 times [2020-07-29 01:30:28,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:28,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104924241] [2020-07-29 01:30:28,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,400 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:28,409 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:28,412 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:28,507 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:28,508 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:28,508 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:28,508 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:28,508 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:28,508 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,508 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:28,508 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:28,508 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration6_Loop [2020-07-29 01:30:28,508 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:28,508 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:28,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,685 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:28,685 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:28,692 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:28,693 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:28,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,718 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:28,719 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:28,721 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:28,721 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~n=0} Honda state: {p_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:28,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:28,745 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,751 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:28,751 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=-8, p_#in~r=-8} Honda state: {p_#in~m=-8, p_#in~r=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,773 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:28,773 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:28,775 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:28,775 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,798 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:28,798 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,822 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:28,822 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:28,880 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:28,881 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:28,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:28,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:28,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:28,882 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:28,882 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:28,882 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:28,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:28,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration6_Loop [2020-07-29 01:30:28,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:28,882 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:28,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:28,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,063 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:29,064 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:29,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:29,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:29,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:29,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:29,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:29,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:29,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:29,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:29,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:29,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:29,095 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:29,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:29,095 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:29,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:29,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:29,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:29,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:29,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:29,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:29,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:29,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:29,124 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:29,124 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:29,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,151 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:29,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:29,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:29,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:29,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:29,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:29,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:29,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:29,156 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:29,159 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:29,159 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,162 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:29,162 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:29,162 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:29,162 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_#in~n) = 1*p_#in~n Supporting invariants [] [2020-07-29 01:30:29,184 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:29,187 INFO L393 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;~r := #in~r;" "assume !(~r > 0);" "assume ~n > 0;" "call #t~ret1 := p(~r, ~n - 1, ~m);"< [2020-07-29 01:30:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:29,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:29,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:29,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:30:29,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:29,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:29,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {2668#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {2668#unseeded} is VALID [2020-07-29 01:30:29,256 INFO L280 TraceCheckUtils]: 1: Hoare triple {2668#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {2668#unseeded} is VALID [2020-07-29 01:30:29,256 INFO L263 TraceCheckUtils]: 2: Hoare triple {2668#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {2668#unseeded} is VALID [2020-07-29 01:30:29,257 INFO L280 TraceCheckUtils]: 3: Hoare triple {2668#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {2668#unseeded} is VALID [2020-07-29 01:30:29,259 INFO L280 TraceCheckUtils]: 4: Hoare triple {2668#unseeded} assume !(~r > 0); {2668#unseeded} is VALID [2020-07-29 01:30:29,260 INFO L280 TraceCheckUtils]: 5: Hoare triple {2668#unseeded} assume ~n > 0; {2668#unseeded} is VALID [2020-07-29 01:30:29,261 INFO L263 TraceCheckUtils]: 6: Hoare triple {2668#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {2668#unseeded} is VALID [2020-07-29 01:30:29,261 INFO L280 TraceCheckUtils]: 7: Hoare triple {2668#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {2668#unseeded} is VALID [2020-07-29 01:30:29,262 INFO L280 TraceCheckUtils]: 8: Hoare triple {2668#unseeded} assume ~r > 0; {2668#unseeded} is VALID [2020-07-29 01:30:29,263 INFO L263 TraceCheckUtils]: 9: Hoare triple {2668#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {2668#unseeded} is VALID [2020-07-29 01:30:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:29,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:29,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:29,321 INFO L280 TraceCheckUtils]: 0: Hoare triple {2671#(>= oldRank0 |p_#in~n|)} ~m := #in~m;~n := #in~n;~r := #in~r; {2713#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:29,322 INFO L280 TraceCheckUtils]: 1: Hoare triple {2713#(<= p_~n oldRank0)} assume !(~r > 0); {2713#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:29,323 INFO L280 TraceCheckUtils]: 2: Hoare triple {2713#(<= p_~n oldRank0)} assume ~n > 0; {2720#(and (<= p_~n oldRank0) (< 0 p_~n))} is VALID [2020-07-29 01:30:29,324 INFO L263 TraceCheckUtils]: 3: Hoare triple {2720#(and (<= p_~n oldRank0) (< 0 p_~n))} call #t~ret1 := p(~r, ~n - 1, ~m); {2681#(or (and (> oldRank0 |p_#in~n|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:29,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:29,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:29,338 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:29,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:29,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:30:29,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 62 states and 70 transitions. Complement of second has 13 states. [2020-07-29 01:30:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:29,433 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:29,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:29,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:29,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:29,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:29,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:29,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:29,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:29,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 70 transitions. [2020-07-29 01:30:29,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:29,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:29,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:29,438 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 28 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:29,438 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:29,439 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:29,439 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:29,440 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:29,440 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 62 states and 70 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:29,441 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:30:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:30:29,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:30:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:29,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:29,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:29,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:29,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:29,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 12 letters. Loop has 4 letters. [2020-07-29 01:30:29,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:30:29,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:30:29,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 11 letters. Loop has 4 letters. [2020-07-29 01:30:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:29,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:29,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:29,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:29,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:29,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 28 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:29,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 70 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:29,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,460 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:29,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:30:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:30:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:29,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 8 letters. [2020-07-29 01:30:29,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:29,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 70 transitions. cyclomatic complexity: 12 [2020-07-29 01:30:29,466 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:29,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 39 states and 46 transitions. [2020-07-29 01:30:29,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:30:29,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:30:29,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2020-07-29 01:30:29,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:29,469 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 46 transitions. [2020-07-29 01:30:29,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2020-07-29 01:30:29,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2020-07-29 01:30:29,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:29,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 46 transitions. Second operand 24 states. [2020-07-29 01:30:29,472 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 46 transitions. Second operand 24 states. [2020-07-29 01:30:29,472 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 24 states. [2020-07-29 01:30:29,473 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:29,475 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2020-07-29 01:30:29,476 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2020-07-29 01:30:29,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:29,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:29,477 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 39 states and 46 transitions. [2020-07-29 01:30:29,477 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 39 states and 46 transitions. [2020-07-29 01:30:29,477 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:29,481 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-29 01:30:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 78 transitions. [2020-07-29 01:30:29,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:29,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:29,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:29,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:29,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:30:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2020-07-29 01:30:29,484 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:30:29,484 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:30:29,485 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:30:29,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:30:29,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:29,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:29,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:29,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:30:29,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:30:29,487 INFO L794 eck$LassoCheckResult]: Stem: 2814#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; 2815#L28 assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; 2811#L29 call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0);< 2819#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2820#L13 assume ~r > 0; 2808#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 2817#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2824#L13 assume !(~r > 0); 2813#L16 assume ~n > 0; 2807#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 2809#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2827#L13 assume ~r > 0; 2805#L14 call #t~ret0 := p(~m, ~r - 1, ~n);< 2806#pENTRY [2020-07-29 01:30:29,487 INFO L796 eck$LassoCheckResult]: Loop: 2806#pENTRY ~m := #in~m;~n := #in~n;~r := #in~r; 2826#L13 assume !(~r > 0); 2825#L16 assume ~n > 0; 2804#L17 call #t~ret1 := p(~r, ~n - 1, ~m);< 2806#pENTRY [2020-07-29 01:30:29,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:29,487 INFO L82 PathProgramCache]: Analyzing trace with hash 651617345, now seen corresponding path program 7 times [2020-07-29 01:30:29,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:29,488 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494540822] [2020-07-29 01:30:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:29,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,496 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,506 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:29,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:29,506 INFO L82 PathProgramCache]: Analyzing trace with hash 929596, now seen corresponding path program 3 times [2020-07-29 01:30:29,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:29,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036452273] [2020-07-29 01:30:29,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:29,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,510 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,512 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,514 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:29,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:29,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1549333372, now seen corresponding path program 8 times [2020-07-29 01:30:29,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:29,515 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067487867] [2020-07-29 01:30:29,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:29,533 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:29,536 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:29,617 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:29,617 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:29,617 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:29,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:29,618 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:29,618 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,618 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:29,618 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:29,618 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration7_Loop [2020-07-29 01:30:29,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:29,619 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:29,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:29,843 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:29,843 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:29,848 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:29,848 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#res=0} Honda state: {p_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,873 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,873 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:29,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:29,876 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~r=0} Honda state: {p_~r=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:29,904 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:29,904 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_~m=0} Honda state: {p_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:29,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,931 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,936 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:29,936 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#in~m=-1, p_#in~r=-1} Honda state: {p_#in~m=-1, p_#in~r=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:29,960 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:29,960 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {p_#t~ret0=0} Honda state: {p_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:29,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:29,983 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,007 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:30,007 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:30,031 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:30,032 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:30,033 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:30,033 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:30,033 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:30,033 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:30,033 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,033 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:30,033 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:30,033 INFO L133 ssoRankerPreferences]: Filename of dumped script: LeeJonesBen-Amram-POPL2001-Ex4.c_Iteration7_Loop [2020-07-29 01:30:30,033 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:30,033 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:30,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:30:30,216 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:30,216 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,227 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,228 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,228 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,229 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,282 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,334 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,335 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,336 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,337 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:30:30,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:30,362 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:30,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:30,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:30,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:30,363 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:30,363 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:30,365 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:30,366 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:30,366 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:30,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:30,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:30,369 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:30,369 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(p_#in~n) = 1*p_#in~n Supporting invariants [] [2020-07-29 01:30:30,391 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:30,394 INFO L393 LassoCheck]: Loop: "~m := #in~m;~n := #in~n;~r := #in~r;" "assume !(~r > 0);" "assume ~n > 0;" "call #t~ret1 := p(~r, ~n - 1, ~m);"< [2020-07-29 01:30:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:30,467 INFO L280 TraceCheckUtils]: 0: Hoare triple {3047#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {3047#unseeded} is VALID [2020-07-29 01:30:30,467 INFO L280 TraceCheckUtils]: 1: Hoare triple {3047#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,468 INFO L263 TraceCheckUtils]: 2: Hoare triple {3047#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {3047#unseeded} is VALID [2020-07-29 01:30:30,469 INFO L280 TraceCheckUtils]: 3: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,469 INFO L280 TraceCheckUtils]: 4: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,470 INFO L263 TraceCheckUtils]: 5: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,471 INFO L280 TraceCheckUtils]: 6: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,471 INFO L280 TraceCheckUtils]: 7: Hoare triple {3047#unseeded} assume !(~r > 0); {3047#unseeded} is VALID [2020-07-29 01:30:30,472 INFO L280 TraceCheckUtils]: 8: Hoare triple {3047#unseeded} assume ~n > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,473 INFO L263 TraceCheckUtils]: 9: Hoare triple {3047#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {3047#unseeded} is VALID [2020-07-29 01:30:30,473 INFO L280 TraceCheckUtils]: 10: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,473 INFO L280 TraceCheckUtils]: 11: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,474 INFO L263 TraceCheckUtils]: 12: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:30,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {3050#(>= oldRank0 |p_#in~n|)} ~m := #in~m;~n := #in~n;~r := #in~r; {3101#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:30,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {3101#(<= p_~n oldRank0)} assume !(~r > 0); {3101#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:30,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {3101#(<= p_~n oldRank0)} assume ~n > 0; {3108#(and (<= p_~n oldRank0) (< 0 p_~n))} is VALID [2020-07-29 01:30:30,538 INFO L263 TraceCheckUtils]: 3: Hoare triple {3108#(and (<= p_~n oldRank0) (< 0 p_~n))} call #t~ret1 := p(~r, ~n - 1, ~m); {3060#(or (and (> oldRank0 |p_#in~n|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:30,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:30,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:30,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,551 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:30,551 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:30:30,634 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 48 states and 55 transitions. Complement of second has 11 states. [2020-07-29 01:30:30,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:30,634 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:30,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:30,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:30,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:30,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 55 transitions. [2020-07-29 01:30:30,636 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:30,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,637 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:30,638 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:30,638 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:30,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:30,639 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:30,639 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 55 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:30,640 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:30,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,656 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:30:30,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,657 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:30,718 INFO L280 TraceCheckUtils]: 0: Hoare triple {3047#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {3047#unseeded} is VALID [2020-07-29 01:30:30,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {3047#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,720 INFO L263 TraceCheckUtils]: 2: Hoare triple {3047#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {3047#unseeded} is VALID [2020-07-29 01:30:30,720 INFO L280 TraceCheckUtils]: 3: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,720 INFO L280 TraceCheckUtils]: 4: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,721 INFO L263 TraceCheckUtils]: 5: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {3047#unseeded} assume !(~r > 0); {3047#unseeded} is VALID [2020-07-29 01:30:30,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {3047#unseeded} assume ~n > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,723 INFO L263 TraceCheckUtils]: 9: Hoare triple {3047#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {3047#unseeded} is VALID [2020-07-29 01:30:30,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,726 INFO L263 TraceCheckUtils]: 12: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:30,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {3050#(>= oldRank0 |p_#in~n|)} ~m := #in~m;~n := #in~n;~r := #in~r; {3216#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:30,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {3216#(<= p_~n oldRank0)} assume !(~r > 0); {3216#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:30,785 INFO L280 TraceCheckUtils]: 2: Hoare triple {3216#(<= p_~n oldRank0)} assume ~n > 0; {3223#(and (<= p_~n oldRank0) (< 0 p_~n))} is VALID [2020-07-29 01:30:30,787 INFO L263 TraceCheckUtils]: 3: Hoare triple {3223#(and (<= p_~n oldRank0) (< 0 p_~n))} call #t~ret1 := p(~r, ~n - 1, ~m); {3060#(or (and (> oldRank0 |p_#in~n|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:30,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:30,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:30,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:30,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,802 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:30,802 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:30:30,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 48 states and 55 transitions. Complement of second has 11 states. [2020-07-29 01:30:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:30,875 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:30,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:30,876 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,876 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:30,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:30,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,877 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 55 transitions. [2020-07-29 01:30:30,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:30,877 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:30,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:30,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:30,878 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:30,878 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:30,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:30,879 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:30,879 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 55 transitions. cyclomatic complexity: 10 [2020-07-29 01:30:30,880 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:30,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:30,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:30,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:30,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:30,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:30,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 55 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:30,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,896 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:30:30,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:30,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:30,897 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:30,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:30,970 INFO L280 TraceCheckUtils]: 0: Hoare triple {3047#unseeded} havoc main_#res;havoc main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~ret5, main_~m~0, main_~n~0, main_~r~0;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~r~0 := main_#t~nondet4;havoc main_#t~nondet4; {3047#unseeded} is VALID [2020-07-29 01:30:30,970 INFO L280 TraceCheckUtils]: 1: Hoare triple {3047#unseeded} assume (main_~m~0 >= 0 && main_~n~0 >= 0) && main_~r~0 >= 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,972 INFO L263 TraceCheckUtils]: 2: Hoare triple {3047#unseeded} call main_#t~ret5 := p(main_~m~0, main_~n~0, main_~r~0); {3047#unseeded} is VALID [2020-07-29 01:30:30,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,974 INFO L280 TraceCheckUtils]: 4: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,975 INFO L263 TraceCheckUtils]: 5: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,975 INFO L280 TraceCheckUtils]: 7: Hoare triple {3047#unseeded} assume !(~r > 0); {3047#unseeded} is VALID [2020-07-29 01:30:30,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {3047#unseeded} assume ~n > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,977 INFO L263 TraceCheckUtils]: 9: Hoare triple {3047#unseeded} call #t~ret1 := p(~r, ~n - 1, ~m); {3047#unseeded} is VALID [2020-07-29 01:30:30,977 INFO L280 TraceCheckUtils]: 10: Hoare triple {3047#unseeded} ~m := #in~m;~n := #in~n;~r := #in~r; {3047#unseeded} is VALID [2020-07-29 01:30:30,978 INFO L280 TraceCheckUtils]: 11: Hoare triple {3047#unseeded} assume ~r > 0; {3047#unseeded} is VALID [2020-07-29 01:30:30,979 INFO L263 TraceCheckUtils]: 12: Hoare triple {3047#unseeded} call #t~ret0 := p(~m, ~r - 1, ~n); {3047#unseeded} is VALID [2020-07-29 01:30:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:30:30,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:30,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:31,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {3050#(>= oldRank0 |p_#in~n|)} ~m := #in~m;~n := #in~n;~r := #in~r; {3331#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:31,045 INFO L280 TraceCheckUtils]: 1: Hoare triple {3331#(<= p_~n oldRank0)} assume !(~r > 0); {3331#(<= p_~n oldRank0)} is VALID [2020-07-29 01:30:31,045 INFO L280 TraceCheckUtils]: 2: Hoare triple {3331#(<= p_~n oldRank0)} assume ~n > 0; {3338#(and (<= p_~n oldRank0) (< 0 p_~n))} is VALID [2020-07-29 01:30:31,047 INFO L263 TraceCheckUtils]: 3: Hoare triple {3338#(and (<= p_~n oldRank0) (< 0 p_~n))} call #t~ret1 := p(~r, ~n - 1, ~m); {3060#(or (and (> oldRank0 |p_#in~n|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:31,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:30:31,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:31,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:31,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,061 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:31,061 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:30:31,164 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 27 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 48 states and 53 transitions. Complement of second has 12 states. [2020-07-29 01:30:31,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:31,165 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:31,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:31,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:31,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:31,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:31,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:31,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:31,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:31,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 53 transitions. [2020-07-29 01:30:31,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:31,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:31,167 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 27 transitions. cyclomatic complexity: 6 [2020-07-29 01:30:31,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:31,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:31,168 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:31,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:31,169 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 48 states and 53 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:31,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 53 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:31,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:31,169 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:31,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 48 letters. Loop has 48 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:31,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 24 letters. Loop has 24 letters. [2020-07-29 01:30:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:31,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:31,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 4 letters. [2020-07-29 01:30:31,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:31,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:31,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:30:31,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:31,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:31,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 14 letters. Loop has 4 letters. [2020-07-29 01:30:31,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 27 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 48 states and 53 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:31,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,178 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:31,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:30:31,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-29 01:30:31,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 17 letters. Loop has 4 letters. [2020-07-29 01:30:31,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 8 letters. [2020-07-29 01:30:31,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:31,180 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 53 transitions. cyclomatic complexity: 8 [2020-07-29 01:30:31,181 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:31,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 0 states and 0 transitions. [2020-07-29 01:30:31,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:31,182 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:31,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:31,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:31,183 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:31,183 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:31,183 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:31,183 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:30:31,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:30:31,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:31,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:31,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:30:31 BoogieIcfgContainer [2020-07-29 01:30:31,191 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:30:31,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:30:31,192 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:30:31,192 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:30:31,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:55" (3/4) ... [2020-07-29 01:30:31,196 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:30:31,197 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:30:31,199 INFO L168 Benchmark]: Toolchain (without parser) took 96355.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.8 MB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -84.2 MB). Peak memory consumption was 234.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:31,200 INFO L168 Benchmark]: CDTParser took 1.06 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:31,200 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.59 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:31,201 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.19 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:31,201 INFO L168 Benchmark]: Boogie Preprocessor took 72.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:31,202 INFO L168 Benchmark]: RCFGBuilder took 325.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:31,202 INFO L168 Benchmark]: BuchiAutomizer took 95649.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 245.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:31,202 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:31,205 INFO L336 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 1.06 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 246.59 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.19 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 325.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.8 MB). Peak memory consumption was 30.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 95649.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.0 MB). Peak memory consumption was 245.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (1 trivial, 5 deterministic, 2 nondeterministic). One deterministic module has 2-nested ranking function (if \old(n) + \old(r) > 0 then 1 else 0), (if \old(n) + \old(r) > 0 then \old(n) + \old(r) else \old(r)) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 5 locations. One deterministic module has 2-nested ranking function (if r + n > 0 then 1 else 0), (if r + n > 0 then r + n else n) and consists of 4 locations. One deterministic module has affine ranking function m and consists of 7 locations. One deterministic module has affine ranking function \old(n) and consists of 4 locations. One nondeterministic module has 2-nested ranking function (if n + r > 0 then 1 else 0), (if n + r > 0 then n + r else n) and consists of 4 locations. One nondeterministic module has affine ranking function \old(n) and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 95.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 40.1s. Construction of modules took 0.4s. Büchi inclusion checks took 54.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 104 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/2 HoareTripleCheckerStatistics: 146 SDtfs, 169 SDslu, 59 SDs, 0 SdLazy, 190 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital25 mio100 ax100 hnf96 lsp73 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq180 hnf89 smp100 dnf100 smp100 tf107 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 3 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 26 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 2 LassoNonterminationAnalysisTime: 32.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...