./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.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/NestedRecursion_1d.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 0837a1e1d82be1b28ccf3514392f1b01c88a9160 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:27:08,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:27:08,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:27:08,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:27:08,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:27:08,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:27:08,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:27:08,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:27:08,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:27:08,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:27:08,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:27:08,911 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:27:08,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:27:08,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:27:08,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:27:08,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:27:08,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:27:08,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:27:08,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:27:08,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:27:08,924 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:27:08,925 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:27:08,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:27:08,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:27:08,931 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:27:08,931 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:27:08,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:27:08,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:27:08,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:27:08,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:27:08,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:27:08,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:27:08,937 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:27:08,938 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:27:08,939 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:27:08,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:27:08,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:27:08,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:27:08,941 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:27:08,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:27:08,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:27:08,944 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:27:08,962 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:27:08,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:27:08,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:27:08,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:27:08,965 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:27:08,965 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:27:08,965 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:27:08,966 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:27:08,966 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:27:08,966 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:27:08,967 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:27:08,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:27:08,967 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:27:08,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:27:08,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:27:08,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:27:08,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:27:08,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:27:08,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:27:08,969 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:27:08,969 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:27:08,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:27:08,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:27:08,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:27:08,971 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:27:08,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:27:08,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:27:08,971 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:27:08,972 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:27:08,973 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:27:08,973 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 -> 0837a1e1d82be1b28ccf3514392f1b01c88a9160 [2020-07-29 01:27:09,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:27:09,319 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:27:09,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:27:09,325 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:27:09,325 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:27:09,326 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2020-07-29 01:27:09,386 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0beda5e5/e3f29da8f580405e9c78a0553ca96bfe/FLAGdc9212207 [2020-07-29 01:27:09,846 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:27:09,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/NestedRecursion_1d.c [2020-07-29 01:27:09,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0beda5e5/e3f29da8f580405e9c78a0553ca96bfe/FLAGdc9212207 [2020-07-29 01:27:10,250 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0beda5e5/e3f29da8f580405e9c78a0553ca96bfe [2020-07-29 01:27:10,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:27:10,257 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:27:10,259 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:10,259 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:27:10,263 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:27:10,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d1baa51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10, skipping insertion in model container [2020-07-29 01:27:10,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:27:10,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:27:10,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:10,468 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:27:10,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:27:10,501 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:27:10,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10 WrapperNode [2020-07-29 01:27:10,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:27:10,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:10,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:27:10,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:27:10,513 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:27:10" (1/1) ... [2020-07-29 01:27:10,518 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:27:10" (1/1) ... [2020-07-29 01:27:10,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:27:10,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:27:10,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:27:10,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:27:10,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (1/1) ... [2020-07-29 01:27:10,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:27:10,614 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:27:10,615 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:27:10,615 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:27:10,616 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (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:27:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2020-07-29 01:27:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2020-07-29 01:27:10,684 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2020-07-29 01:27:10,684 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2020-07-29 01:27:10,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:27:10,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:27:10,900 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:27:10,901 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-29 01:27:10,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:10 BoogieIcfgContainer [2020-07-29 01:27:10,905 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:27:10,905 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:27:10,906 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:27:10,910 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:27:10,911 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:10,911 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:27:10" (1/3) ... [2020-07-29 01:27:10,912 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f125433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:10, skipping insertion in model container [2020-07-29 01:27:10,912 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:10,912 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:27:10" (2/3) ... [2020-07-29 01:27:10,913 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f125433 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:27:10, skipping insertion in model container [2020-07-29 01:27:10,913 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:27:10,913 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:10" (3/3) ... [2020-07-29 01:27:10,915 INFO L371 chiAutomizerObserver]: Analyzing ICFG NestedRecursion_1d.c [2020-07-29 01:27:10,995 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:27:10,996 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:27:10,996 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:27:10,996 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:27:10,996 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:27:10,996 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:27:10,997 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:27:10,997 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:27:11,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 01:27:11,061 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:11,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:11,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:11,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:11,071 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:11,071 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:27:11,071 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-07-29 01:27:11,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:11,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:11,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:11,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:11,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:11,090 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 22#L25true call main_#t~ret6 := rec2(main_~x~0);< 3#rec2ENTRYtrue [2020-07-29 01:27:11,090 INFO L796 eck$LassoCheckResult]: Loop: 3#rec2ENTRYtrue ~j := #in~j; 20#L18true assume !(~j <= 0); 18#L20true call #t~ret3 := rec1(~j);< 4#rec1ENTRYtrue ~i := #in~i; 9#L12true assume ~i <= 0;#res := 0; 5#rec1FINALtrue assume true; 12#rec1EXITtrue >#33#return; 23#L20-1true call #t~ret4 := rec2(#t~ret3 - 1);< 3#rec2ENTRYtrue [2020-07-29 01:27:11,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:11,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 1 times [2020-07-29 01:27:11,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:11,109 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106381973] [2020-07-29 01:27:11,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,215 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1102838740, now seen corresponding path program 1 times [2020-07-29 01:27:11,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:11,217 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147610365] [2020-07-29 01:27:11,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:11,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:27:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:11,379 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} ~i := #in~i; {34#(= |rec1_#in~i| rec1_~i)} is VALID [2020-07-29 01:27:11,381 INFO L280 TraceCheckUtils]: 1: Hoare triple {34#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {35#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:11,382 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#(<= |rec1_#in~i| 0)} assume true; {35#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:11,385 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#(<= |rec1_#in~i| 0)} {29#(<= 1 rec2_~j)} #33#return; {28#false} is VALID [2020-07-29 01:27:11,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} ~j := #in~j; {27#true} is VALID [2020-07-29 01:27:11,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} assume !(~j <= 0); {29#(<= 1 rec2_~j)} is VALID [2020-07-29 01:27:11,390 INFO L263 TraceCheckUtils]: 2: Hoare triple {29#(<= 1 rec2_~j)} call #t~ret3 := rec1(~j); {27#true} is VALID [2020-07-29 01:27:11,392 INFO L280 TraceCheckUtils]: 3: Hoare triple {27#true} ~i := #in~i; {34#(= |rec1_#in~i| rec1_~i)} is VALID [2020-07-29 01:27:11,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {34#(= |rec1_#in~i| rec1_~i)} assume ~i <= 0;#res := 0; {35#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:11,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#(<= |rec1_#in~i| 0)} assume true; {35#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:11,397 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {35#(<= |rec1_#in~i| 0)} {29#(<= 1 rec2_~j)} #33#return; {28#false} is VALID [2020-07-29 01:27:11,397 INFO L263 TraceCheckUtils]: 7: Hoare triple {28#false} call #t~ret4 := rec2(#t~ret3 - 1); {28#false} is VALID [2020-07-29 01:27:11,398 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:27:11,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147610365] [2020-07-29 01:27:11,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:11,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 01:27:11,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407576564] [2020-07-29 01:27:11,407 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:27:11,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:11,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:27:11,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:27:11,427 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-29 01:27:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:11,696 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2020-07-29 01:27:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:27:11,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:11,718 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:11,721 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 33 transitions. [2020-07-29 01:27:11,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:11,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 22 transitions. [2020-07-29 01:27:11,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-07-29 01:27:11,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-07-29 01:27:11,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:27:11,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:11,759 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:27:11,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:27:11,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:27:11,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:11,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:27:11,800 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:27:11,802 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:27:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:11,811 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:27:11,812 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:27:11,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:11,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:11,815 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:27:11,815 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:27:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:11,823 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:27:11,823 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:27:11,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:11,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:11,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:11,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:11,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:27:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:27:11,835 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:27:11,835 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:27:11,836 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:27:11,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:27:11,843 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:11,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:11,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:11,846 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:27:11,846 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:11,847 INFO L794 eck$LassoCheckResult]: Stem: 77#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 64#L25 call main_#t~ret6 := rec2(main_~x~0);< 63#rec2ENTRY [2020-07-29 01:27:11,847 INFO L796 eck$LassoCheckResult]: Loop: 63#rec2ENTRY ~j := #in~j; 66#L18 assume !(~j <= 0); 71#L20 call #t~ret3 := rec1(~j);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume !(~i <= 0); 68#L14 call #t~ret0 := rec1(~i - 2);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#27#return; 69#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#29#return; 70#L14-2 call #t~ret2 := rec1(#t~ret1);< 67#rec1ENTRY ~i := #in~i; 72#L12 assume ~i <= 0;#res := 0; 73#rec1FINAL assume true; 74#rec1EXIT >#31#return; 75#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 76#rec1FINAL assume true; 78#rec1EXIT >#33#return; 65#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 63#rec2ENTRY [2020-07-29 01:27:11,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:11,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1617, now seen corresponding path program 2 times [2020-07-29 01:27:11,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:11,850 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680274325] [2020-07-29 01:27:11,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,875 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:11,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash -616266826, now seen corresponding path program 1 times [2020-07-29 01:27:11,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:11,879 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122349046] [2020-07-29 01:27:11,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,931 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,959 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1277860358, now seen corresponding path program 1 times [2020-07-29 01:27:11,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:11,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144939555] [2020-07-29 01:27:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,981 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:11,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:12,001 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:12,335 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2020-07-29 01:27:12,632 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:12,633 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:12,633 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:12,634 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:12,634 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:12,634 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:12,634 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:12,635 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:12,635 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2020-07-29 01:27:12,635 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:12,635 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:12,663 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:27:12,674 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:27:12,679 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:27:12,684 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:27:12,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:27:12,811 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:12,812 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:27:12,818 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:12,819 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:27:12,829 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:12,829 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_~j=0} Honda state: {rec2_~j=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) [2020-07-29 01:27:12,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:12,871 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:12,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:12,876 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret3=0} Honda state: {rec2_#t~ret3=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) [2020-07-29 01:27:12,919 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:12,920 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:12,924 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:12,924 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#res=0} Honda state: {rec2_#res=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) [2020-07-29 01:27:12,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:12,962 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:12,967 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:12,967 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec2_#t~ret4=0} Honda state: {rec2_#t~ret4=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:27:13,013 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:13,014 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 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:27:13,068 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:13,068 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:13,075 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:13,110 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:13,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:13,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:13,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:13,111 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:13,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,112 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:13,112 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:13,112 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration2_Loop [2020-07-29 01:27:13,112 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:13,112 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:13,118 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:27:13,122 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:27:13,127 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:27:13,132 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:27:13,142 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:27:13,253 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:13,259 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:27:13,264 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:27:13,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:13,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:13,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:13,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:13,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:13,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:13,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,276 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 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,328 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:27:13,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:13,330 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:13,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:13,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:13,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:13,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:13,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:13,335 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 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,367 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:27:13,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:13,369 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:13,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:13,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:13,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:13,371 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:13,371 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:13,373 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) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,408 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:27:13,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:13,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:13,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:13,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:13,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:13,413 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:13,413 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:13,416 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:13,422 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:13,423 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 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:13,432 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:13,432 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:13,432 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:13,433 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec2_#in~j) = 1*rec2_#in~j Supporting invariants [] [2020-07-29 01:27:13,467 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:13,471 INFO L393 LassoCheck]: Loop: "~j := #in~j;" "assume !(~j <= 0);" "call #t~ret3 := rec1(~j);"< "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#27#return;" "call #t~ret1 := rec1(#t~ret0 - 1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#29#return;" "call #t~ret2 := rec1(#t~ret1);"< "~i := #in~i;" "assume ~i <= 0;#res := 0;" "assume true;" >"#31#return;" "#res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0;" "assume true;" >"#33#return;" "call #t~ret4 := rec2(#t~ret3 - 1);"< [2020-07-29 01:27:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:13,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:27:13,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:13,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:13,547 INFO L280 TraceCheckUtils]: 0: Hoare triple {120#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {120#unseeded} is VALID [2020-07-29 01:27:13,549 INFO L263 TraceCheckUtils]: 1: Hoare triple {120#unseeded} call main_#t~ret6 := rec2(main_~x~0); {120#unseeded} is VALID [2020-07-29 01:27:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:13,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-29 01:27:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:13,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:14,280 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#(>= oldRank0 |rec2_#in~j|)} ~j := #in~j; {141#(<= rec2_~j oldRank0)} is VALID [2020-07-29 01:27:14,281 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#(<= rec2_~j oldRank0)} assume !(~j <= 0); {145#(<= 1 oldRank0)} is VALID [2020-07-29 01:27:14,282 INFO L263 TraceCheckUtils]: 2: Hoare triple {145#(<= 1 oldRank0)} call #t~ret3 := rec1(~j); {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,283 INFO L280 TraceCheckUtils]: 3: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,284 INFO L280 TraceCheckUtils]: 4: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume !(~i <= 0); {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,285 INFO L263 TraceCheckUtils]: 5: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} call #t~ret0 := rec1(~i - 2); {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,286 INFO L280 TraceCheckUtils]: 6: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,287 INFO L280 TraceCheckUtils]: 8: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume true; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,289 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {149#(<= |old(oldRank0)| oldRank0)} {149#(<= |old(oldRank0)| oldRank0)} #27#return; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,290 INFO L263 TraceCheckUtils]: 10: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} call #t~ret1 := rec1(#t~ret0 - 1); {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,291 INFO L280 TraceCheckUtils]: 11: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,292 INFO L280 TraceCheckUtils]: 12: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,293 INFO L280 TraceCheckUtils]: 13: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume true; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,296 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {149#(<= |old(oldRank0)| oldRank0)} {149#(<= |old(oldRank0)| oldRank0)} #29#return; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,297 INFO L263 TraceCheckUtils]: 15: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} call #t~ret2 := rec1(#t~ret1); {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,298 INFO L280 TraceCheckUtils]: 16: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} ~i := #in~i; {149#(<= |old(oldRank0)| oldRank0)} is VALID [2020-07-29 01:27:14,298 INFO L280 TraceCheckUtils]: 17: Hoare triple {149#(<= |old(oldRank0)| oldRank0)} assume ~i <= 0;#res := 0; {195#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 0))} is VALID [2020-07-29 01:27:14,299 INFO L280 TraceCheckUtils]: 18: Hoare triple {195#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 0))} assume true; {195#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 0))} is VALID [2020-07-29 01:27:14,301 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {195#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 0))} {149#(<= |old(oldRank0)| oldRank0)} #31#return; {202#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#t~ret2| 0))} is VALID [2020-07-29 01:27:14,302 INFO L280 TraceCheckUtils]: 20: Hoare triple {202#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#t~ret2| 0))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {206#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 1))} is VALID [2020-07-29 01:27:14,304 INFO L280 TraceCheckUtils]: 21: Hoare triple {206#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 1))} assume true; {206#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 1))} is VALID [2020-07-29 01:27:14,306 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {206#(and (<= |old(oldRank0)| oldRank0) (<= |rec1_#res| 1))} {145#(<= 1 oldRank0)} #33#return; {213#(and (<= 1 oldRank0) (<= |rec2_#t~ret3| 1))} is VALID [2020-07-29 01:27:14,308 INFO L263 TraceCheckUtils]: 23: Hoare triple {213#(and (<= 1 oldRank0) (<= |rec2_#t~ret3| 1))} call #t~ret4 := rec2(#t~ret3 - 1); {133#(or (and (> oldRank0 |rec2_#in~j|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:14,308 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-29 01:27:14,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:27:14,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:14,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:14,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:14,362 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-07-29 01:27:14,362 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-07-29 01:27:15,284 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 22 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 101 states and 147 transitions. Complement of second has 42 states. [2020-07-29 01:27:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:15,285 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:15,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:15,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:15,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:15,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states. [2020-07-29 01:27:15,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:27:15,295 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:15,295 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:15,296 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 147 transitions. [2020-07-29 01:27:15,299 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:15,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:15,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:15,302 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 8 [2020-07-29 01:27:15,312 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:15,312 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states. [2020-07-29 01:27:15,315 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:27:15,316 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:15,316 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 101 states and 147 transitions. cyclomatic complexity: 50 [2020-07-29 01:27:15,334 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:27:15,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:27:15,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:27:15,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 101 letters. Loop has 101 letters. [2020-07-29 01:27:15,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:15,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:15,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:27:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:15,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:27:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:15,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:27:15,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:15,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:15,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:27:15,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:15,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:15,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:27:15,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 24 letters. [2020-07-29 01:27:15,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 24 letters. [2020-07-29 01:27:15,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 12 letters. Loop has 24 letters. [2020-07-29 01:27:15,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 12 letters. Loop has 8 letters. [2020-07-29 01:27:15,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 17 letters. Loop has 13 letters. [2020-07-29 01:27:15,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 17 letters. Loop has 29 letters. [2020-07-29 01:27:15,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 17 letters. Loop has 29 letters. [2020-07-29 01:27:15,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 17 letters. Loop has 29 letters. [2020-07-29 01:27:15,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 24 letters. [2020-07-29 01:27:15,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 3 letters. Loop has 24 letters. [2020-07-29 01:27:15,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 24 letters. [2020-07-29 01:27:15,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 24 letters. [2020-07-29 01:27:15,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 4 letters. Loop has 24 letters. [2020-07-29 01:27:15,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 4 letters. Loop has 24 letters. [2020-07-29 01:27:15,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 25 letters. Loop has 24 letters. [2020-07-29 01:27:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 9 letters. [2020-07-29 01:27:15,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:15,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:15,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:15,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:15,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:15,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:15,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:15,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:15,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:15,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:15,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:15,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:15,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:15,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:15,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:15,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:15,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:15,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:15,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 20 letters. Loop has 29 letters. [2020-07-29 01:27:15,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 20 letters. Loop has 29 letters. [2020-07-29 01:27:15,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 20 letters. Loop has 29 letters. [2020-07-29 01:27:15,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 106 letters. Loop has 40 letters. [2020-07-29 01:27:15,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 106 letters. Loop has 40 letters. [2020-07-29 01:27:15,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 106 letters. Loop has 40 letters. [2020-07-29 01:27:15,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 107 letters. Loop has 40 letters. [2020-07-29 01:27:15,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 107 letters. Loop has 40 letters. [2020-07-29 01:27:15,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 107 letters. Loop has 40 letters. [2020-07-29 01:27:15,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 108 letters. Loop has 40 letters. [2020-07-29 01:27:15,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 108 letters. Loop has 40 letters. [2020-07-29 01:27:15,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 108 letters. Loop has 40 letters. [2020-07-29 01:27:15,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 8 Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states. Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 101 states and 147 transitions. cyclomatic complexity: 50 Stem has 145 letters. Loop has 40 letters. [2020-07-29 01:27:15,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,409 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:27:15,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 36 transitions. [2020-07-29 01:27:15,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 24 letters. [2020-07-29 01:27:15,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 26 letters. Loop has 24 letters. [2020-07-29 01:27:15,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 36 transitions. Stem has 2 letters. Loop has 48 letters. [2020-07-29 01:27:15,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:15,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 147 transitions. cyclomatic complexity: 50 [2020-07-29 01:27:15,447 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:15,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 89 states and 135 transitions. [2020-07-29 01:27:15,465 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2020-07-29 01:27:15,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2020-07-29 01:27:15,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 89 states and 135 transitions. [2020-07-29 01:27:15,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:15,472 INFO L688 BuchiCegarLoop]: Abstraction has 89 states and 135 transitions. [2020-07-29 01:27:15,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states and 135 transitions. [2020-07-29 01:27:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2020-07-29 01:27:15,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:15,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states and 135 transitions. Second operand 62 states. [2020-07-29 01:27:15,486 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states and 135 transitions. Second operand 62 states. [2020-07-29 01:27:15,487 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand 62 states. [2020-07-29 01:27:15,487 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:15,538 INFO L93 Difference]: Finished difference Result 245 states and 375 transitions. [2020-07-29 01:27:15,538 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 375 transitions. [2020-07-29 01:27:15,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:15,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:15,554 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 89 states and 135 transitions. [2020-07-29 01:27:15,554 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 89 states and 135 transitions. [2020-07-29 01:27:15,554 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:15,609 INFO L93 Difference]: Finished difference Result 360 states and 553 transitions. [2020-07-29 01:27:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 553 transitions. [2020-07-29 01:27:15,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:15,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:15,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:15,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-29 01:27:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 98 transitions. [2020-07-29 01:27:15,620 INFO L711 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-07-29 01:27:15,620 INFO L591 BuchiCegarLoop]: Abstraction has 62 states and 98 transitions. [2020-07-29 01:27:15,620 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:27:15,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 98 transitions. [2020-07-29 01:27:15,623 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:15,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:15,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:15,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:15,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:15,624 INFO L794 eck$LassoCheckResult]: Stem: 415#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 378#L25 call main_#t~ret6 := rec2(main_~x~0);< 377#rec2ENTRY ~j := #in~j; 380#L18 assume !(~j <= 0); 410#L20 call #t~ret3 := rec1(~j);< 422#rec1ENTRY ~i := #in~i; 409#L12 assume !(~i <= 0); 386#L14 call #t~ret0 := rec1(~i - 2);< 383#rec1ENTRY [2020-07-29 01:27:15,624 INFO L796 eck$LassoCheckResult]: Loop: 383#rec1ENTRY ~i := #in~i; 391#L12 assume !(~i <= 0); 385#L14 call #t~ret0 := rec1(~i - 2);< 383#rec1ENTRY [2020-07-29 01:27:15,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:15,624 INFO L82 PathProgramCache]: Analyzing trace with hash 874549579, now seen corresponding path program 1 times [2020-07-29 01:27:15,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:15,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510828354] [2020-07-29 01:27:15,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,635 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,638 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:15,639 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 1 times [2020-07-29 01:27:15,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:15,640 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856592913] [2020-07-29 01:27:15,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,646 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:15,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash 434890603, now seen corresponding path program 2 times [2020-07-29 01:27:15,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:15,648 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13521180] [2020-07-29 01:27:15,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:15,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,654 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:15,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:15,661 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:15,728 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:15,728 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:15,728 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:15,728 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:15,728 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:15,728 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:15,728 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:15,728 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:15,728 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2020-07-29 01:27:15,729 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:15,729 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:15,737 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:27:15,741 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:27:15,746 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:27:15,753 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:27:15,756 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:27:15,770 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:27:15,883 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:15,883 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:15,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:15,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:15,897 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:15,897 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret0=0} Honda state: {rec1_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:15,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:15,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:15,930 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:15,930 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:27:15,953 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:15,953 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:15,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:15,962 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:27:15,984 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:15,984 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:15,987 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:15,987 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:27:16,011 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:16,011 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:16,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:16,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:16,071 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:16,073 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:16,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:16,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:16,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:16,073 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:16,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:16,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:16,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:16,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration3_Loop [2020-07-29 01:27:16,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:16,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:16,077 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:27:16,088 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:27:16,092 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:27:16,097 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:27:16,106 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:27:16,113 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:27:16,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:16,235 INFO L489 LassoAnalysis]: Using template 'affine'. 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:27:16,238 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:27:16,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:16,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:16,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:16,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:16,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:16,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:16,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:16,243 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:27:16,267 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:27:16,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:16,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:16,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:16,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:16,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:16,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:16,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:16,271 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:27:16,295 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:27:16,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:16,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:16,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:16,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:16,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:16,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:16,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:16,301 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:27:16,324 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:27:16,325 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:16,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:16,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:16,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:16,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:16,327 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:16,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:16,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:16,337 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:16,337 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 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:27:16,342 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:16,342 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:16,343 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:16,343 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-07-29 01:27:16,367 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:16,369 INFO L393 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2020-07-29 01:27:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:27:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:16,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {1376#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {1376#unseeded} is VALID [2020-07-29 01:27:16,456 INFO L263 TraceCheckUtils]: 1: Hoare triple {1376#unseeded} call main_#t~ret6 := rec2(main_~x~0); {1376#unseeded} is VALID [2020-07-29 01:27:16,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {1376#unseeded} ~j := #in~j; {1376#unseeded} is VALID [2020-07-29 01:27:16,457 INFO L280 TraceCheckUtils]: 3: Hoare triple {1376#unseeded} assume !(~j <= 0); {1376#unseeded} is VALID [2020-07-29 01:27:16,458 INFO L263 TraceCheckUtils]: 4: Hoare triple {1376#unseeded} call #t~ret3 := rec1(~j); {1376#unseeded} is VALID [2020-07-29 01:27:16,459 INFO L280 TraceCheckUtils]: 5: Hoare triple {1376#unseeded} ~i := #in~i; {1376#unseeded} is VALID [2020-07-29 01:27:16,459 INFO L280 TraceCheckUtils]: 6: Hoare triple {1376#unseeded} assume !(~i <= 0); {1376#unseeded} is VALID [2020-07-29 01:27:16,460 INFO L263 TraceCheckUtils]: 7: Hoare triple {1376#unseeded} call #t~ret0 := rec1(~i - 2); {1376#unseeded} is VALID [2020-07-29 01:27:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:16,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {1379#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {1415#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:16,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1415#(<= rec1_~i oldRank0)} assume !(~i <= 0); {1419#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:16,537 INFO L263 TraceCheckUtils]: 2: Hoare triple {1419#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {1389#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:16,537 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:27:16,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:27:16,552 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:27:16,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,553 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:27:16,553 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40 Second operand 4 states. [2020-07-29 01:27:16,725 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 62 states and 98 transitions. cyclomatic complexity: 40. Second operand 4 states. Result 108 states and 165 transitions. Complement of second has 13 states. [2020-07-29 01:27:16,725 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:27:16,725 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:16,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states and 98 transitions. cyclomatic complexity: 40 [2020-07-29 01:27:16,726 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:16,726 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:16,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:27:16,728 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:16,728 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:16,728 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:16,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 165 transitions. [2020-07-29 01:27:16,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:16,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:16,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:16,732 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 62 states and 98 transitions. cyclomatic complexity: 40 [2020-07-29 01:27:16,740 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:27:16,741 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:27:16,742 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:16,742 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:16,742 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 108 states and 165 transitions. cyclomatic complexity: 63 [2020-07-29 01:27:16,750 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:27:16,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 108 letters. Loop has 108 letters. [2020-07-29 01:27:16,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 108 letters. Loop has 108 letters. [2020-07-29 01:27:16,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 108 letters. Loop has 108 letters. [2020-07-29 01:27:16,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:27:16,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:27:16,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 62 letters. Loop has 62 letters. [2020-07-29 01:27:16,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:16,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:16,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:16,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:16,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:16,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:27:16,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:16,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:27:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:27:16,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:16,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:16,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:16,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:16,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:16,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:16,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:16,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:16,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:16,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:16,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:16,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:16,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:16,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:16,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 62 states and 98 transitions. cyclomatic complexity: 40 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 108 states and 165 transitions. cyclomatic complexity: 63 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:16,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,812 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:16,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:27:16,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2020-07-29 01:27:16,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:27:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:27:16,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-29 01:27:16,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:16,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 165 transitions. cyclomatic complexity: 63 [2020-07-29 01:27:16,825 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:16,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 96 states and 153 transitions. [2020-07-29 01:27:16,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2020-07-29 01:27:16,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-07-29 01:27:16,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 153 transitions. [2020-07-29 01:27:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:16,836 INFO L688 BuchiCegarLoop]: Abstraction has 96 states and 153 transitions. [2020-07-29 01:27:16,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 153 transitions. [2020-07-29 01:27:16,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2020-07-29 01:27:16,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:16,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states and 153 transitions. Second operand 92 states. [2020-07-29 01:27:16,847 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states and 153 transitions. Second operand 92 states. [2020-07-29 01:27:16,847 INFO L87 Difference]: Start difference. First operand 96 states and 153 transitions. Second operand 92 states. [2020-07-29 01:27:16,847 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:16,874 INFO L93 Difference]: Finished difference Result 303 states and 468 transitions. [2020-07-29 01:27:16,875 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 468 transitions. [2020-07-29 01:27:16,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:16,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:16,878 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 96 states and 153 transitions. [2020-07-29 01:27:16,878 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 96 states and 153 transitions. [2020-07-29 01:27:16,879 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:16,910 INFO L93 Difference]: Finished difference Result 331 states and 510 transitions. [2020-07-29 01:27:16,910 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 510 transitions. [2020-07-29 01:27:16,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:16,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:16,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:16,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-29 01:27:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 143 transitions. [2020-07-29 01:27:16,921 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2020-07-29 01:27:16,921 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 143 transitions. [2020-07-29 01:27:16,921 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:27:16,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 143 transitions. [2020-07-29 01:27:16,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:16,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:16,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:16,924 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:16,924 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:16,924 INFO L794 eck$LassoCheckResult]: Stem: 1593#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 1594#L25 call main_#t~ret6 := rec2(main_~x~0);< 1597#rec2ENTRY ~j := #in~j; 1614#L18 assume !(~j <= 0); 1568#L20 call #t~ret3 := rec1(~j);< 1606#rec1ENTRY ~i := #in~i; 1615#L12 assume !(~i <= 0); 1556#L14 call #t~ret0 := rec1(~i - 2);< 1555#rec1ENTRY ~i := #in~i; 1558#L12 assume ~i <= 0;#res := 0; 1617#rec1FINAL assume true; 1602#rec1EXIT >#27#return; 1567#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 1570#rec1ENTRY [2020-07-29 01:27:16,924 INFO L796 eck$LassoCheckResult]: Loop: 1570#rec1ENTRY ~i := #in~i; 1610#L12 assume !(~i <= 0); 1586#L14 call #t~ret0 := rec1(~i - 2);< 1570#rec1ENTRY [2020-07-29 01:27:16,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:16,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1317996508, now seen corresponding path program 1 times [2020-07-29 01:27:16,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:16,925 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841920904] [2020-07-29 01:27:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:16,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:16,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:16,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:16,941 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 2 times [2020-07-29 01:27:16,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:16,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973510475] [2020-07-29 01:27:16,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:16,944 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:16,947 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:16,948 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:16,948 INFO L82 PathProgramCache]: Analyzing trace with hash -157050054, now seen corresponding path program 2 times [2020-07-29 01:27:16,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:16,949 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047663213] [2020-07-29 01:27:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:16,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:16,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:27:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {2617#true} ~i := #in~i; {2617#true} is VALID [2020-07-29 01:27:17,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {2617#true} assume ~i <= 0;#res := 0; {2626#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:17,016 INFO L280 TraceCheckUtils]: 2: Hoare triple {2626#(<= |rec1_#res| 0)} assume true; {2626#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:17,017 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2626#(<= |rec1_#res| 0)} {2617#true} #27#return; {2623#(<= |rec1_#t~ret0| 0)} is VALID [2020-07-29 01:27:17,017 INFO L280 TraceCheckUtils]: 0: Hoare triple {2617#true} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {2617#true} is VALID [2020-07-29 01:27:17,017 INFO L263 TraceCheckUtils]: 1: Hoare triple {2617#true} call main_#t~ret6 := rec2(main_~x~0); {2617#true} is VALID [2020-07-29 01:27:17,018 INFO L280 TraceCheckUtils]: 2: Hoare triple {2617#true} ~j := #in~j; {2617#true} is VALID [2020-07-29 01:27:17,018 INFO L280 TraceCheckUtils]: 3: Hoare triple {2617#true} assume !(~j <= 0); {2617#true} is VALID [2020-07-29 01:27:17,019 INFO L263 TraceCheckUtils]: 4: Hoare triple {2617#true} call #t~ret3 := rec1(~j); {2617#true} is VALID [2020-07-29 01:27:17,019 INFO L280 TraceCheckUtils]: 5: Hoare triple {2617#true} ~i := #in~i; {2617#true} is VALID [2020-07-29 01:27:17,019 INFO L280 TraceCheckUtils]: 6: Hoare triple {2617#true} assume !(~i <= 0); {2617#true} is VALID [2020-07-29 01:27:17,019 INFO L263 TraceCheckUtils]: 7: Hoare triple {2617#true} call #t~ret0 := rec1(~i - 2); {2617#true} is VALID [2020-07-29 01:27:17,019 INFO L280 TraceCheckUtils]: 8: Hoare triple {2617#true} ~i := #in~i; {2617#true} is VALID [2020-07-29 01:27:17,021 INFO L280 TraceCheckUtils]: 9: Hoare triple {2617#true} assume ~i <= 0;#res := 0; {2626#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:17,021 INFO L280 TraceCheckUtils]: 10: Hoare triple {2626#(<= |rec1_#res| 0)} assume true; {2626#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:17,023 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2626#(<= |rec1_#res| 0)} {2617#true} #27#return; {2623#(<= |rec1_#t~ret0| 0)} is VALID [2020-07-29 01:27:17,024 INFO L263 TraceCheckUtils]: 12: Hoare triple {2623#(<= |rec1_#t~ret0| 0)} call #t~ret1 := rec1(#t~ret0 - 1); {2624#(<= (+ |rec1_#in~i| 1) 0)} is VALID [2020-07-29 01:27:17,025 INFO L280 TraceCheckUtils]: 13: Hoare triple {2624#(<= (+ |rec1_#in~i| 1) 0)} ~i := #in~i; {2625#(<= (+ rec1_~i 1) 0)} is VALID [2020-07-29 01:27:17,025 INFO L280 TraceCheckUtils]: 14: Hoare triple {2625#(<= (+ rec1_~i 1) 0)} assume !(~i <= 0); {2618#false} is VALID [2020-07-29 01:27:17,026 INFO L263 TraceCheckUtils]: 15: Hoare triple {2618#false} call #t~ret0 := rec1(~i - 2); {2618#false} is VALID [2020-07-29 01:27:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:27:17,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047663213] [2020-07-29 01:27:17,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:27:17,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-29 01:27:17,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105764261] [2020-07-29 01:27:17,073 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:17,073 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:17,073 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:17,073 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:17,073 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:17,073 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,073 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:17,074 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:17,074 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2020-07-29 01:27:17,074 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:17,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:17,078 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:27:17,082 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:27:17,086 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:27:17,090 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:27:17,094 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:27:17,101 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:27:17,224 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:17,224 INFO L404 LassoAnalysis]: Checking for nontermination... 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:27:17,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:17,233 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:17,235 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:17,235 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,258 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:17,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:17,261 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:17,261 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret1=0} Honda state: {rec1_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,285 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:17,285 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:17,295 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:17,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:17,334 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:17,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:17,341 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=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) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,368 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:17,369 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,394 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:17,394 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:27:17,420 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:17,421 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:17,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:17,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:17,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:17,422 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:17,422 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,422 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:17,422 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:17,422 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration4_Loop [2020-07-29 01:27:17,422 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:17,422 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:17,426 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:27:17,429 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:27:17,436 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:27:17,439 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:27:17,446 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:27:17,450 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:27:17,567 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:17,567 INFO L489 LassoAnalysis]: Using template 'affine'. 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:27:17,569 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:27:17,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:17,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:17,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:17,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:17,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:17,573 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:17,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:17,575 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:17,601 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:17,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:17,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:17,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:17,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:17,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:17,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:17,605 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 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:17,627 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:27:17,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:17,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:17,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:17,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:17,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:17,631 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:17,631 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:17,637 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:27:17,660 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:27:17,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:17,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:17,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:17,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:17,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:17,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:17,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:17,668 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:17,671 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:17,672 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 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:27:17,674 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:17,674 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:17,674 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:17,674 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-07-29 01:27:17,698 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:17,701 INFO L393 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2020-07-29 01:27:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:17,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:27:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,762 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:17,803 INFO L280 TraceCheckUtils]: 0: Hoare triple {2627#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {2627#unseeded} is VALID [2020-07-29 01:27:17,804 INFO L263 TraceCheckUtils]: 1: Hoare triple {2627#unseeded} call main_#t~ret6 := rec2(main_~x~0); {2627#unseeded} is VALID [2020-07-29 01:27:17,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {2627#unseeded} ~j := #in~j; {2627#unseeded} is VALID [2020-07-29 01:27:17,806 INFO L280 TraceCheckUtils]: 3: Hoare triple {2627#unseeded} assume !(~j <= 0); {2627#unseeded} is VALID [2020-07-29 01:27:17,806 INFO L263 TraceCheckUtils]: 4: Hoare triple {2627#unseeded} call #t~ret3 := rec1(~j); {2627#unseeded} is VALID [2020-07-29 01:27:17,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {2627#unseeded} ~i := #in~i; {2627#unseeded} is VALID [2020-07-29 01:27:17,808 INFO L280 TraceCheckUtils]: 6: Hoare triple {2627#unseeded} assume !(~i <= 0); {2627#unseeded} is VALID [2020-07-29 01:27:17,809 INFO L263 TraceCheckUtils]: 7: Hoare triple {2627#unseeded} call #t~ret0 := rec1(~i - 2); {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:17,809 INFO L280 TraceCheckUtils]: 8: Hoare triple {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:17,810 INFO L280 TraceCheckUtils]: 9: Hoare triple {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:17,810 INFO L280 TraceCheckUtils]: 10: Hoare triple {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:17,812 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2666#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {2627#unseeded} #27#return; {2627#unseeded} is VALID [2020-07-29 01:27:17,812 INFO L263 TraceCheckUtils]: 12: Hoare triple {2627#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {2627#unseeded} is VALID [2020-07-29 01:27:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:17,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:17,883 INFO L280 TraceCheckUtils]: 0: Hoare triple {2630#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {2682#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:17,884 INFO L280 TraceCheckUtils]: 1: Hoare triple {2682#(<= rec1_~i oldRank0)} assume !(~i <= 0); {2686#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:17,885 INFO L263 TraceCheckUtils]: 2: Hoare triple {2686#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {2640#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:17,885 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:27:17,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:17,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:17,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:17,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:17,909 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:17,910 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57 Second operand 5 states. [2020-07-29 01:27:18,118 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 143 transitions. cyclomatic complexity: 57. Second operand 5 states. Result 132 states and 207 transitions. Complement of second has 14 states. [2020-07-29 01:27:18,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:18,118 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:18,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 143 transitions. cyclomatic complexity: 57 [2020-07-29 01:27:18,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:18,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:18,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:18,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:18,120 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:18,120 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:18,120 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 207 transitions. [2020-07-29 01:27:18,122 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:18,122 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:18,122 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:18,123 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 92 states and 143 transitions. cyclomatic complexity: 57 [2020-07-29 01:27:18,128 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:27:18,128 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:18,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:18,129 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:18,129 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 132 states and 207 transitions. cyclomatic complexity: 83 [2020-07-29 01:27:18,134 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 16 examples of accepted words. [2020-07-29 01:27:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 132 letters. Loop has 132 letters. [2020-07-29 01:27:18,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 132 letters. Loop has 132 letters. [2020-07-29 01:27:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 132 letters. Loop has 132 letters. [2020-07-29 01:27:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 92 letters. Loop has 92 letters. [2020-07-29 01:27:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 92 letters. Loop has 92 letters. [2020-07-29 01:27:18,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 92 letters. Loop has 92 letters. [2020-07-29 01:27:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:18,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:18,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:27:18,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:27:18,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:18,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:18,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 8 letters. [2020-07-29 01:27:18,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:18,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:18,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 24 letters. [2020-07-29 01:27:18,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 15 letters. Loop has 40 letters. [2020-07-29 01:27:18,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:27:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:27:18,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 19 letters. Loop has 3 letters. [2020-07-29 01:27:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:27:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:27:18,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 3 letters. [2020-07-29 01:27:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 18 letters. Loop has 3 letters. [2020-07-29 01:27:18,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 61 letters. [2020-07-29 01:27:18,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 45 letters. [2020-07-29 01:27:18,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 20 letters. Loop has 77 letters. [2020-07-29 01:27:18,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 31 letters. Loop has 40 letters. [2020-07-29 01:27:18,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:18,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:18,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:18,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:18,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:18,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 31 letters. Loop has 8 letters. [2020-07-29 01:27:18,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 42 letters. Loop has 40 letters. [2020-07-29 01:27:18,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 43 letters. Loop has 40 letters. [2020-07-29 01:27:18,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 44 letters. Loop has 40 letters. [2020-07-29 01:27:18,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 143 transitions. cyclomatic complexity: 57 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 132 states and 207 transitions. cyclomatic complexity: 83 Stem has 41 letters. Loop has 40 letters. [2020-07-29 01:27:18,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,180 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 01:27:18,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:27:18,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 16 letters. Loop has 3 letters. [2020-07-29 01:27:18,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:27:18,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:18,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 207 transitions. cyclomatic complexity: 83 [2020-07-29 01:27:18,192 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:18,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 120 states and 195 transitions. [2020-07-29 01:27:18,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2020-07-29 01:27:18,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2020-07-29 01:27:18,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 195 transitions. [2020-07-29 01:27:18,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:18,204 INFO L688 BuchiCegarLoop]: Abstraction has 120 states and 195 transitions. [2020-07-29 01:27:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 195 transitions. [2020-07-29 01:27:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 116. [2020-07-29 01:27:18,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:18,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states and 195 transitions. Second operand 116 states. [2020-07-29 01:27:18,215 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states and 195 transitions. Second operand 116 states. [2020-07-29 01:27:18,215 INFO L87 Difference]: Start difference. First operand 120 states and 195 transitions. Second operand 116 states. [2020-07-29 01:27:18,215 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:18,251 INFO L93 Difference]: Finished difference Result 393 states and 618 transitions. [2020-07-29 01:27:18,252 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 618 transitions. [2020-07-29 01:27:18,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:18,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:18,256 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 120 states and 195 transitions. [2020-07-29 01:27:18,256 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 120 states and 195 transitions. [2020-07-29 01:27:18,256 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:18,299 INFO L93 Difference]: Finished difference Result 421 states and 660 transitions. [2020-07-29 01:27:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 660 transitions. [2020-07-29 01:27:18,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:18,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:18,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:18,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-07-29 01:27:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 185 transitions. [2020-07-29 01:27:18,313 INFO L711 BuchiCegarLoop]: Abstraction has 116 states and 185 transitions. [2020-07-29 01:27:18,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:18,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:27:18,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:27:18,314 INFO L87 Difference]: Start difference. First operand 116 states and 185 transitions. Second operand 6 states. [2020-07-29 01:27:18,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:18,501 INFO L93 Difference]: Finished difference Result 129 states and 195 transitions. [2020-07-29 01:27:18,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:27:18,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:27:18,520 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:27:18,520 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 195 transitions. [2020-07-29 01:27:18,530 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-07-29 01:27:18,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 127 states and 193 transitions. [2020-07-29 01:27:18,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2020-07-29 01:27:18,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2020-07-29 01:27:18,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 193 transitions. [2020-07-29 01:27:18,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:18,546 INFO L688 BuchiCegarLoop]: Abstraction has 127 states and 193 transitions. [2020-07-29 01:27:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 193 transitions. [2020-07-29 01:27:18,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 104. [2020-07-29 01:27:18,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:18,575 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states and 193 transitions. Second operand 104 states. [2020-07-29 01:27:18,575 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states and 193 transitions. Second operand 104 states. [2020-07-29 01:27:18,575 INFO L87 Difference]: Start difference. First operand 127 states and 193 transitions. Second operand 104 states. [2020-07-29 01:27:18,576 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:18,626 INFO L93 Difference]: Finished difference Result 421 states and 664 transitions. [2020-07-29 01:27:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 664 transitions. [2020-07-29 01:27:18,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:18,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:18,632 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 127 states and 193 transitions. [2020-07-29 01:27:18,632 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 127 states and 193 transitions. [2020-07-29 01:27:18,633 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:18,674 INFO L93 Difference]: Finished difference Result 489 states and 776 transitions. [2020-07-29 01:27:18,674 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 776 transitions. [2020-07-29 01:27:18,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:18,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:18,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:18,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:18,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-29 01:27:18,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2020-07-29 01:27:18,686 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2020-07-29 01:27:18,686 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 157 transitions. [2020-07-29 01:27:18,687 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:27:18,687 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 157 transitions. [2020-07-29 01:27:18,688 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-07-29 01:27:18,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:18,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:18,689 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:18,689 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:18,689 INFO L794 eck$LassoCheckResult]: Stem: 4375#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 4376#L25 call main_#t~ret6 := rec2(main_~x~0);< 4380#rec2ENTRY ~j := #in~j; 4394#L18 assume !(~j <= 0); 4348#L20 call #t~ret3 := rec1(~j);< 4393#rec1ENTRY ~i := #in~i; 4392#L12 assume !(~i <= 0); 4342#L14 call #t~ret0 := rec1(~i - 2);< 4390#rec1ENTRY ~i := #in~i; 4389#L12 assume !(~i <= 0); 4355#L14 call #t~ret0 := rec1(~i - 2);< 4388#rec1ENTRY ~i := #in~i; 4391#L12 assume ~i <= 0;#res := 0; 4407#rec1FINAL assume true; 4406#rec1EXIT >#27#return; 4334#L14-1 [2020-07-29 01:27:18,690 INFO L796 eck$LassoCheckResult]: Loop: 4334#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 4333#rec1ENTRY ~i := #in~i; 4336#L12 assume ~i <= 0;#res := 0; 4410#rec1FINAL assume true; 4401#rec1EXIT >#29#return; 4352#L14-2 call #t~ret2 := rec1(#t~ret1);< 4365#rec1ENTRY ~i := #in~i; 4404#L12 assume !(~i <= 0); 4357#L14 call #t~ret0 := rec1(~i - 2);< 4365#rec1ENTRY ~i := #in~i; 4404#L12 assume ~i <= 0;#res := 0; 4403#rec1FINAL assume true; 4402#rec1EXIT >#27#return; 4334#L14-1 [2020-07-29 01:27:18,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:18,691 INFO L82 PathProgramCache]: Analyzing trace with hash -377207200, now seen corresponding path program 1 times [2020-07-29 01:27:18,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:18,691 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492876579] [2020-07-29 01:27:18,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:18,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:18,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:18,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:18,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:18,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1306212703, now seen corresponding path program 1 times [2020-07-29 01:27:18,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:18,741 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965165451] [2020-07-29 01:27:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:18,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-07-29 01:27:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:18,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {5781#true} ~i := #in~i; {5781#true} is VALID [2020-07-29 01:27:18,815 INFO L280 TraceCheckUtils]: 1: Hoare triple {5781#true} assume ~i <= 0;#res := 0; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,815 INFO L280 TraceCheckUtils]: 2: Hoare triple {5794#(<= |rec1_#res| 0)} assume true; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,817 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5794#(<= |rec1_#res| 0)} {5781#true} #29#return; {5787#(<= |rec1_#t~ret1| 0)} is VALID [2020-07-29 01:27:18,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2020-07-29 01:27:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:18,831 INFO L280 TraceCheckUtils]: 0: Hoare triple {5781#true} ~i := #in~i; {5781#true} is VALID [2020-07-29 01:27:18,832 INFO L280 TraceCheckUtils]: 1: Hoare triple {5781#true} assume ~i <= 0;#res := 0; {5781#true} is VALID [2020-07-29 01:27:18,832 INFO L280 TraceCheckUtils]: 2: Hoare triple {5781#true} assume true; {5781#true} is VALID [2020-07-29 01:27:18,832 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {5781#true} {5782#false} #27#return; {5782#false} is VALID [2020-07-29 01:27:18,832 INFO L263 TraceCheckUtils]: 0: Hoare triple {5781#true} call #t~ret1 := rec1(#t~ret0 - 1); {5781#true} is VALID [2020-07-29 01:27:18,833 INFO L280 TraceCheckUtils]: 1: Hoare triple {5781#true} ~i := #in~i; {5781#true} is VALID [2020-07-29 01:27:18,833 INFO L280 TraceCheckUtils]: 2: Hoare triple {5781#true} assume ~i <= 0;#res := 0; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,834 INFO L280 TraceCheckUtils]: 3: Hoare triple {5794#(<= |rec1_#res| 0)} assume true; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,835 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5794#(<= |rec1_#res| 0)} {5781#true} #29#return; {5787#(<= |rec1_#t~ret1| 0)} is VALID [2020-07-29 01:27:18,836 INFO L263 TraceCheckUtils]: 5: Hoare triple {5787#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5788#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:18,837 INFO L280 TraceCheckUtils]: 6: Hoare triple {5788#(<= |rec1_#in~i| 0)} ~i := #in~i; {5789#(<= rec1_~i 0)} is VALID [2020-07-29 01:27:18,837 INFO L280 TraceCheckUtils]: 7: Hoare triple {5789#(<= rec1_~i 0)} assume !(~i <= 0); {5782#false} is VALID [2020-07-29 01:27:18,838 INFO L263 TraceCheckUtils]: 8: Hoare triple {5782#false} call #t~ret0 := rec1(~i - 2); {5781#true} is VALID [2020-07-29 01:27:18,838 INFO L280 TraceCheckUtils]: 9: Hoare triple {5781#true} ~i := #in~i; {5781#true} is VALID [2020-07-29 01:27:18,838 INFO L280 TraceCheckUtils]: 10: Hoare triple {5781#true} assume ~i <= 0;#res := 0; {5781#true} is VALID [2020-07-29 01:27:18,838 INFO L280 TraceCheckUtils]: 11: Hoare triple {5781#true} assume true; {5781#true} is VALID [2020-07-29 01:27:18,839 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5781#true} {5782#false} #27#return; {5782#false} is VALID [2020-07-29 01:27:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:27:18,839 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965165451] [2020-07-29 01:27:18,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029655105] [2020-07-29 01:27:18,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:18,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:27:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:18,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:18,959 INFO L263 TraceCheckUtils]: 0: Hoare triple {5781#true} call #t~ret1 := rec1(#t~ret0 - 1); {5781#true} is VALID [2020-07-29 01:27:18,960 INFO L280 TraceCheckUtils]: 1: Hoare triple {5781#true} ~i := #in~i; {5781#true} is VALID [2020-07-29 01:27:18,961 INFO L280 TraceCheckUtils]: 2: Hoare triple {5781#true} assume ~i <= 0;#res := 0; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,962 INFO L280 TraceCheckUtils]: 3: Hoare triple {5794#(<= |rec1_#res| 0)} assume true; {5794#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:18,963 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5794#(<= |rec1_#res| 0)} {5781#true} #29#return; {5787#(<= |rec1_#t~ret1| 0)} is VALID [2020-07-29 01:27:18,964 INFO L263 TraceCheckUtils]: 5: Hoare triple {5787#(<= |rec1_#t~ret1| 0)} call #t~ret2 := rec1(#t~ret1); {5788#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:18,966 INFO L280 TraceCheckUtils]: 6: Hoare triple {5788#(<= |rec1_#in~i| 0)} ~i := #in~i; {5789#(<= rec1_~i 0)} is VALID [2020-07-29 01:27:18,967 INFO L280 TraceCheckUtils]: 7: Hoare triple {5789#(<= rec1_~i 0)} assume !(~i <= 0); {5782#false} is VALID [2020-07-29 01:27:18,968 INFO L263 TraceCheckUtils]: 8: Hoare triple {5782#false} call #t~ret0 := rec1(~i - 2); {5782#false} is VALID [2020-07-29 01:27:18,968 INFO L280 TraceCheckUtils]: 9: Hoare triple {5782#false} ~i := #in~i; {5782#false} is VALID [2020-07-29 01:27:18,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {5782#false} assume ~i <= 0;#res := 0; {5782#false} is VALID [2020-07-29 01:27:18,969 INFO L280 TraceCheckUtils]: 11: Hoare triple {5782#false} assume true; {5782#false} is VALID [2020-07-29 01:27:18,969 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {5782#false} {5782#false} #27#return; {5782#false} is VALID [2020-07-29 01:27:18,970 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:27:18,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:27:18,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2020-07-29 01:27:18,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703053520] [2020-07-29 01:27:18,971 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:27:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:27:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:27:18,973 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. cyclomatic complexity: 59 Second operand 6 states. [2020-07-29 01:27:19,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:19,155 INFO L93 Difference]: Finished difference Result 119 states and 173 transitions. [2020-07-29 01:27:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:27:19,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:27:19,175 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:27:19,175 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 119 states and 173 transitions. [2020-07-29 01:27:19,182 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:19,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 119 states to 114 states and 164 transitions. [2020-07-29 01:27:19,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2020-07-29 01:27:19,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2020-07-29 01:27:19,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 114 states and 164 transitions. [2020-07-29 01:27:19,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:19,190 INFO L688 BuchiCegarLoop]: Abstraction has 114 states and 164 transitions. [2020-07-29 01:27:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states and 164 transitions. [2020-07-29 01:27:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2020-07-29 01:27:19,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:19,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states and 164 transitions. Second operand 111 states. [2020-07-29 01:27:19,196 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states and 164 transitions. Second operand 111 states. [2020-07-29 01:27:19,197 INFO L87 Difference]: Start difference. First operand 114 states and 164 transitions. Second operand 111 states. [2020-07-29 01:27:19,197 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:19,226 INFO L93 Difference]: Finished difference Result 384 states and 579 transitions. [2020-07-29 01:27:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 579 transitions. [2020-07-29 01:27:19,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:19,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:19,231 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand 114 states and 164 transitions. [2020-07-29 01:27:19,231 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 114 states and 164 transitions. [2020-07-29 01:27:19,231 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:19,257 INFO L93 Difference]: Finished difference Result 384 states and 579 transitions. [2020-07-29 01:27:19,258 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 579 transitions. [2020-07-29 01:27:19,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:19,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:19,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:19,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-07-29 01:27:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2020-07-29 01:27:19,268 INFO L711 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2020-07-29 01:27:19,268 INFO L591 BuchiCegarLoop]: Abstraction has 111 states and 161 transitions. [2020-07-29 01:27:19,269 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:27:19,269 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. [2020-07-29 01:27:19,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:19,270 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:19,270 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:19,271 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:19,271 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:19,272 INFO L794 eck$LassoCheckResult]: Stem: 6003#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 6004#L25 call main_#t~ret6 := rec2(main_~x~0);< 6012#rec2ENTRY ~j := #in~j; 6026#L18 assume !(~j <= 0); 6018#L20 call #t~ret3 := rec1(~j);< 6025#rec1ENTRY ~i := #in~i; 6024#L12 assume !(~i <= 0); 5969#L14 call #t~ret0 := rec1(~i - 2);< 6023#rec1ENTRY ~i := #in~i; 6021#L12 assume !(~i <= 0); 5975#L14 call #t~ret0 := rec1(~i - 2);< 6020#rec1ENTRY ~i := #in~i; 6022#L12 assume ~i <= 0;#res := 0; 6036#rec1FINAL assume true; 6035#rec1EXIT >#27#return; 5963#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 5962#rec1ENTRY ~i := #in~i; 5964#L12 assume ~i <= 0;#res := 0; 5996#rec1FINAL assume true; 6033#rec1EXIT >#29#return; 5997#L14-2 call #t~ret2 := rec1(#t~ret1);< 5998#rec1ENTRY ~i := #in~i; 6039#L12 assume ~i <= 0;#res := 0; 6038#rec1FINAL assume true; 6001#rec1EXIT >#31#return; 5991#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 5968#rec1FINAL assume true; 5978#rec1EXIT >#27#return; 5970#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 6006#rec1ENTRY [2020-07-29 01:27:19,272 INFO L796 eck$LassoCheckResult]: Loop: 6006#rec1ENTRY ~i := #in~i; 6029#L12 assume !(~i <= 0); 5976#L14 call #t~ret0 := rec1(~i - 2);< 6006#rec1ENTRY [2020-07-29 01:27:19,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1733863270, now seen corresponding path program 1 times [2020-07-29 01:27:19,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,273 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437396212] [2020-07-29 01:27:19,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,293 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,297 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:19,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 3 times [2020-07-29 01:27:19,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,299 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847568731] [2020-07-29 01:27:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,302 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:19,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:19,305 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:19,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:19,305 INFO L82 PathProgramCache]: Analyzing trace with hash -2050992272, now seen corresponding path program 2 times [2020-07-29 01:27:19,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:19,306 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822395207] [2020-07-29 01:27:19,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,361 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:27:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:27:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,417 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,421 INFO L280 TraceCheckUtils]: 2: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,421 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7251#true} {7251#true} #27#return; {7251#true} is VALID [2020-07-29 01:27:19,421 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:27:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,433 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,433 INFO L280 TraceCheckUtils]: 2: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,434 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7251#true} {7251#true} #29#return; {7251#true} is VALID [2020-07-29 01:27:19,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-07-29 01:27:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {7290#(<= |rec1_#res| 0)} assume true; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {7290#(<= |rec1_#res| 0)} {7251#true} #31#return; {7288#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:19,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {7251#true} assume !(~i <= 0); {7251#true} is VALID [2020-07-29 01:27:19,501 INFO L263 TraceCheckUtils]: 2: Hoare triple {7251#true} call #t~ret0 := rec1(~i - 2); {7251#true} is VALID [2020-07-29 01:27:19,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,502 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {7251#true} {7251#true} #27#return; {7251#true} is VALID [2020-07-29 01:27:19,502 INFO L263 TraceCheckUtils]: 7: Hoare triple {7251#true} call #t~ret1 := rec1(#t~ret0 - 1); {7251#true} is VALID [2020-07-29 01:27:19,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,503 INFO L280 TraceCheckUtils]: 10: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,504 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {7251#true} {7251#true} #29#return; {7251#true} is VALID [2020-07-29 01:27:19,504 INFO L263 TraceCheckUtils]: 12: Hoare triple {7251#true} call #t~ret2 := rec1(#t~ret1); {7251#true} is VALID [2020-07-29 01:27:19,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,505 INFO L280 TraceCheckUtils]: 14: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {7290#(<= |rec1_#res| 0)} assume true; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,507 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {7290#(<= |rec1_#res| 0)} {7251#true} #31#return; {7288#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:19,508 INFO L280 TraceCheckUtils]: 17: Hoare triple {7288#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,508 INFO L280 TraceCheckUtils]: 18: Hoare triple {7289#(<= |rec1_#res| 1)} assume true; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,509 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7289#(<= |rec1_#res| 1)} {7251#true} #27#return; {7273#(<= |rec1_#t~ret0| 1)} is VALID [2020-07-29 01:27:19,510 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {7251#true} is VALID [2020-07-29 01:27:19,510 INFO L263 TraceCheckUtils]: 1: Hoare triple {7251#true} call main_#t~ret6 := rec2(main_~x~0); {7251#true} is VALID [2020-07-29 01:27:19,510 INFO L280 TraceCheckUtils]: 2: Hoare triple {7251#true} ~j := #in~j; {7251#true} is VALID [2020-07-29 01:27:19,510 INFO L280 TraceCheckUtils]: 3: Hoare triple {7251#true} assume !(~j <= 0); {7251#true} is VALID [2020-07-29 01:27:19,511 INFO L263 TraceCheckUtils]: 4: Hoare triple {7251#true} call #t~ret3 := rec1(~j); {7251#true} is VALID [2020-07-29 01:27:19,511 INFO L280 TraceCheckUtils]: 5: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {7251#true} assume !(~i <= 0); {7251#true} is VALID [2020-07-29 01:27:19,511 INFO L263 TraceCheckUtils]: 7: Hoare triple {7251#true} call #t~ret0 := rec1(~i - 2); {7251#true} is VALID [2020-07-29 01:27:19,511 INFO L280 TraceCheckUtils]: 8: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,512 INFO L280 TraceCheckUtils]: 9: Hoare triple {7251#true} assume !(~i <= 0); {7251#true} is VALID [2020-07-29 01:27:19,512 INFO L263 TraceCheckUtils]: 10: Hoare triple {7251#true} call #t~ret0 := rec1(~i - 2); {7251#true} is VALID [2020-07-29 01:27:19,512 INFO L280 TraceCheckUtils]: 11: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L280 TraceCheckUtils]: 12: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L280 TraceCheckUtils]: 13: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7251#true} {7251#true} #27#return; {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L263 TraceCheckUtils]: 15: Hoare triple {7251#true} call #t~ret1 := rec1(#t~ret0 - 1); {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L280 TraceCheckUtils]: 16: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,513 INFO L280 TraceCheckUtils]: 17: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,514 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7251#true} {7251#true} #29#return; {7251#true} is VALID [2020-07-29 01:27:19,514 INFO L263 TraceCheckUtils]: 20: Hoare triple {7251#true} call #t~ret2 := rec1(#t~ret1); {7251#true} is VALID [2020-07-29 01:27:19,514 INFO L280 TraceCheckUtils]: 21: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,515 INFO L280 TraceCheckUtils]: 22: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,516 INFO L280 TraceCheckUtils]: 23: Hoare triple {7290#(<= |rec1_#res| 0)} assume true; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,517 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {7290#(<= |rec1_#res| 0)} {7251#true} #31#return; {7288#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:19,518 INFO L280 TraceCheckUtils]: 25: Hoare triple {7288#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,518 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#(<= |rec1_#res| 1)} assume true; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,519 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7289#(<= |rec1_#res| 1)} {7251#true} #27#return; {7273#(<= |rec1_#t~ret0| 1)} is VALID [2020-07-29 01:27:19,520 INFO L263 TraceCheckUtils]: 28: Hoare triple {7273#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {7274#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:19,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {7274#(<= |rec1_#in~i| 0)} ~i := #in~i; {7275#(<= rec1_~i 0)} is VALID [2020-07-29 01:27:19,522 INFO L280 TraceCheckUtils]: 30: Hoare triple {7275#(<= rec1_~i 0)} assume !(~i <= 0); {7252#false} is VALID [2020-07-29 01:27:19,523 INFO L263 TraceCheckUtils]: 31: Hoare triple {7252#false} call #t~ret0 := rec1(~i - 2); {7252#false} is VALID [2020-07-29 01:27:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-29 01:27:19,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822395207] [2020-07-29 01:27:19,524 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549901789] [2020-07-29 01:27:19,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:27:19,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:19,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:19,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:19,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:19,696 INFO L280 TraceCheckUtils]: 0: Hoare triple {7251#true} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {7251#true} is VALID [2020-07-29 01:27:19,697 INFO L263 TraceCheckUtils]: 1: Hoare triple {7251#true} call main_#t~ret6 := rec2(main_~x~0); {7251#true} is VALID [2020-07-29 01:27:19,697 INFO L280 TraceCheckUtils]: 2: Hoare triple {7251#true} ~j := #in~j; {7251#true} is VALID [2020-07-29 01:27:19,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {7251#true} assume !(~j <= 0); {7251#true} is VALID [2020-07-29 01:27:19,698 INFO L263 TraceCheckUtils]: 4: Hoare triple {7251#true} call #t~ret3 := rec1(~j); {7251#true} is VALID [2020-07-29 01:27:19,698 INFO L280 TraceCheckUtils]: 5: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,698 INFO L280 TraceCheckUtils]: 6: Hoare triple {7251#true} assume !(~i <= 0); {7251#true} is VALID [2020-07-29 01:27:19,698 INFO L263 TraceCheckUtils]: 7: Hoare triple {7251#true} call #t~ret0 := rec1(~i - 2); {7251#true} is VALID [2020-07-29 01:27:19,698 INFO L280 TraceCheckUtils]: 8: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,699 INFO L280 TraceCheckUtils]: 9: Hoare triple {7251#true} assume !(~i <= 0); {7251#true} is VALID [2020-07-29 01:27:19,699 INFO L263 TraceCheckUtils]: 10: Hoare triple {7251#true} call #t~ret0 := rec1(~i - 2); {7251#true} is VALID [2020-07-29 01:27:19,699 INFO L280 TraceCheckUtils]: 11: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,700 INFO L280 TraceCheckUtils]: 12: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,700 INFO L280 TraceCheckUtils]: 13: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,700 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7251#true} {7251#true} #27#return; {7251#true} is VALID [2020-07-29 01:27:19,700 INFO L263 TraceCheckUtils]: 15: Hoare triple {7251#true} call #t~ret1 := rec1(#t~ret0 - 1); {7251#true} is VALID [2020-07-29 01:27:19,700 INFO L280 TraceCheckUtils]: 16: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,701 INFO L280 TraceCheckUtils]: 17: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7251#true} is VALID [2020-07-29 01:27:19,701 INFO L280 TraceCheckUtils]: 18: Hoare triple {7251#true} assume true; {7251#true} is VALID [2020-07-29 01:27:19,701 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7251#true} {7251#true} #29#return; {7251#true} is VALID [2020-07-29 01:27:19,701 INFO L263 TraceCheckUtils]: 20: Hoare triple {7251#true} call #t~ret2 := rec1(#t~ret1); {7251#true} is VALID [2020-07-29 01:27:19,701 INFO L280 TraceCheckUtils]: 21: Hoare triple {7251#true} ~i := #in~i; {7251#true} is VALID [2020-07-29 01:27:19,703 INFO L280 TraceCheckUtils]: 22: Hoare triple {7251#true} assume ~i <= 0;#res := 0; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,703 INFO L280 TraceCheckUtils]: 23: Hoare triple {7290#(<= |rec1_#res| 0)} assume true; {7290#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:19,705 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {7290#(<= |rec1_#res| 0)} {7251#true} #31#return; {7288#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:19,706 INFO L280 TraceCheckUtils]: 25: Hoare triple {7288#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,707 INFO L280 TraceCheckUtils]: 26: Hoare triple {7289#(<= |rec1_#res| 1)} assume true; {7289#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:19,708 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7289#(<= |rec1_#res| 1)} {7251#true} #27#return; {7273#(<= |rec1_#t~ret0| 1)} is VALID [2020-07-29 01:27:19,709 INFO L263 TraceCheckUtils]: 28: Hoare triple {7273#(<= |rec1_#t~ret0| 1)} call #t~ret1 := rec1(#t~ret0 - 1); {7274#(<= |rec1_#in~i| 0)} is VALID [2020-07-29 01:27:19,710 INFO L280 TraceCheckUtils]: 29: Hoare triple {7274#(<= |rec1_#in~i| 0)} ~i := #in~i; {7275#(<= rec1_~i 0)} is VALID [2020-07-29 01:27:19,711 INFO L280 TraceCheckUtils]: 30: Hoare triple {7275#(<= rec1_~i 0)} assume !(~i <= 0); {7252#false} is VALID [2020-07-29 01:27:19,711 INFO L263 TraceCheckUtils]: 31: Hoare triple {7252#false} call #t~ret0 := rec1(~i - 2); {7252#false} is VALID [2020-07-29 01:27:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2020-07-29 01:27:19,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:19,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-29 01:27:19,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275434363] [2020-07-29 01:27:19,757 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:19,757 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:19,757 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:19,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:19,758 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:19,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:19,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:19,758 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:19,758 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2020-07-29 01:27:19,758 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:19,758 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:19,763 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:27:19,770 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:27:19,773 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:27:19,776 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:27:19,784 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:27:19,788 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:27:19,890 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:19,891 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:27:19,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:19,901 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:19,905 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:19,905 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#t~ret2=0} Honda state: {rec1_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:27:19,949 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:19,949 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:27:19,953 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:19,953 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_#res=0} Honda state: {rec1_#res=0} 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) [2020-07-29 01:27:19,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:19,991 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:19,995 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:27:19,995 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {rec1_~i=0} Honda state: {rec1_~i=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) [2020-07-29 01:27:20,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:20,033 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:20,082 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:20,082 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,122 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:20,124 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:20,124 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:20,124 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:20,124 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:20,125 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:20,125 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,125 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:20,125 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:20,125 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration6_Loop [2020-07-29 01:27:20,125 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:20,125 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:20,131 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:27:20,135 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:27:20,140 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:27:20,149 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:27:20,153 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:27:20,157 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:27:20,262 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:20,262 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:27:20,265 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:27:20,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,267 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,270 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 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:27:20,298 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:27:20,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,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 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:20,350 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:27:20,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:20,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:20,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:20,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:20,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:20,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:20,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:20,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:20,358 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:20,358 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 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:27:20,360 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:20,360 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:20,360 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:20,360 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-07-29 01:27:20,383 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:20,386 INFO L393 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2020-07-29 01:27:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:20,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:20,509 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,525 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,535 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,540 INFO L280 TraceCheckUtils]: 0: Hoare triple {7384#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {7384#unseeded} is VALID [2020-07-29 01:27:20,541 INFO L263 TraceCheckUtils]: 1: Hoare triple {7384#unseeded} call main_#t~ret6 := rec2(main_~x~0); {7384#unseeded} is VALID [2020-07-29 01:27:20,542 INFO L280 TraceCheckUtils]: 2: Hoare triple {7384#unseeded} ~j := #in~j; {7384#unseeded} is VALID [2020-07-29 01:27:20,542 INFO L280 TraceCheckUtils]: 3: Hoare triple {7384#unseeded} assume !(~j <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:20,544 INFO L263 TraceCheckUtils]: 4: Hoare triple {7384#unseeded} call #t~ret3 := rec1(~j); {7384#unseeded} is VALID [2020-07-29 01:27:20,544 INFO L280 TraceCheckUtils]: 5: Hoare triple {7384#unseeded} ~i := #in~i; {7384#unseeded} is VALID [2020-07-29 01:27:20,545 INFO L280 TraceCheckUtils]: 6: Hoare triple {7384#unseeded} assume !(~i <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:20,546 INFO L263 TraceCheckUtils]: 7: Hoare triple {7384#unseeded} call #t~ret0 := rec1(~i - 2); {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,547 INFO L280 TraceCheckUtils]: 9: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,548 INFO L263 TraceCheckUtils]: 10: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,548 INFO L280 TraceCheckUtils]: 11: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,549 INFO L280 TraceCheckUtils]: 12: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,549 INFO L280 TraceCheckUtils]: 13: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,550 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,551 INFO L263 TraceCheckUtils]: 15: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,552 INFO L280 TraceCheckUtils]: 16: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,552 INFO L280 TraceCheckUtils]: 17: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,552 INFO L280 TraceCheckUtils]: 18: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,554 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,555 INFO L263 TraceCheckUtils]: 20: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,556 INFO L280 TraceCheckUtils]: 21: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,556 INFO L280 TraceCheckUtils]: 22: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,557 INFO L280 TraceCheckUtils]: 23: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,560 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,561 INFO L280 TraceCheckUtils]: 25: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,561 INFO L280 TraceCheckUtils]: 26: Hoare triple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:20,562 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7423#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7384#unseeded} #27#return; {7384#unseeded} is VALID [2020-07-29 01:27:20,563 INFO L263 TraceCheckUtils]: 28: Hoare triple {7384#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7384#unseeded} is VALID [2020-07-29 01:27:20,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:20,630 INFO L280 TraceCheckUtils]: 0: Hoare triple {7387#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {7487#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:20,632 INFO L280 TraceCheckUtils]: 1: Hoare triple {7487#(<= rec1_~i oldRank0)} assume !(~i <= 0); {7491#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:20,635 INFO L263 TraceCheckUtils]: 2: Hoare triple {7491#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7397#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:20,635 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:27:20,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:20,683 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:20,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,684 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:20,684 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-07-29 01:27:20,806 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2020-07-29 01:27:20,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:20,806 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:20,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:20,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:20,807 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:20,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:20,808 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:20,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:20,808 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 179 transitions. [2020-07-29 01:27:20,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:20,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:20,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:20,810 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:20,815 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:20,815 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:20,816 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:20,816 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 15 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:20,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:20,817 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:27:20,817 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 128 states and 179 transitions. cyclomatic complexity: 57 [2020-07-29 01:27:20,821 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:20,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:20,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:20,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:20,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:20,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:20,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:20,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:20,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:20,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:20,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:20,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:20,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,865 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:20,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:27:20,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:20,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:20,867 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,920 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:20,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:20,967 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,975 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,987 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:20,996 INFO L280 TraceCheckUtils]: 0: Hoare triple {7384#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {7384#unseeded} is VALID [2020-07-29 01:27:20,997 INFO L263 TraceCheckUtils]: 1: Hoare triple {7384#unseeded} call main_#t~ret6 := rec2(main_~x~0); {7384#unseeded} is VALID [2020-07-29 01:27:20,998 INFO L280 TraceCheckUtils]: 2: Hoare triple {7384#unseeded} ~j := #in~j; {7384#unseeded} is VALID [2020-07-29 01:27:20,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {7384#unseeded} assume !(~j <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:21,000 INFO L263 TraceCheckUtils]: 4: Hoare triple {7384#unseeded} call #t~ret3 := rec1(~j); {7384#unseeded} is VALID [2020-07-29 01:27:21,000 INFO L280 TraceCheckUtils]: 5: Hoare triple {7384#unseeded} ~i := #in~i; {7384#unseeded} is VALID [2020-07-29 01:27:21,001 INFO L280 TraceCheckUtils]: 6: Hoare triple {7384#unseeded} assume !(~i <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:21,002 INFO L263 TraceCheckUtils]: 7: Hoare triple {7384#unseeded} call #t~ret0 := rec1(~i - 2); {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,003 INFO L280 TraceCheckUtils]: 8: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,004 INFO L280 TraceCheckUtils]: 9: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,005 INFO L263 TraceCheckUtils]: 10: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,006 INFO L280 TraceCheckUtils]: 11: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,009 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,010 INFO L263 TraceCheckUtils]: 15: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,011 INFO L280 TraceCheckUtils]: 16: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,011 INFO L280 TraceCheckUtils]: 17: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,012 INFO L280 TraceCheckUtils]: 18: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,014 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,015 INFO L263 TraceCheckUtils]: 20: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,016 INFO L280 TraceCheckUtils]: 21: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,016 INFO L280 TraceCheckUtils]: 22: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,017 INFO L280 TraceCheckUtils]: 23: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,019 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,019 INFO L280 TraceCheckUtils]: 25: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,020 INFO L280 TraceCheckUtils]: 26: Hoare triple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,021 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7660#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7384#unseeded} #27#return; {7384#unseeded} is VALID [2020-07-29 01:27:21,022 INFO L263 TraceCheckUtils]: 28: Hoare triple {7384#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7384#unseeded} is VALID [2020-07-29 01:27:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {7387#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {7724#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:21,094 INFO L280 TraceCheckUtils]: 1: Hoare triple {7724#(<= rec1_~i oldRank0)} assume !(~i <= 0); {7728#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:21,096 INFO L263 TraceCheckUtils]: 2: Hoare triple {7728#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7397#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:21,096 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:27:21,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:21,136 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:21,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,137 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:21,137 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-07-29 01:27:21,274 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 128 states and 179 transitions. Complement of second has 7 states. [2020-07-29 01:27:21,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:21,275 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:21,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:21,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:21,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:21,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 179 transitions. [2020-07-29 01:27:21,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 01:27:21,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:21,278 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:21,278 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:21,279 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:21,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 15 transitions. cyclomatic complexity: 14 [2020-07-29 01:27:21,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:21,279 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:27:21,279 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 128 states and 179 transitions. cyclomatic complexity: 57 [2020-07-29 01:27:21,283 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:21,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:21,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 128 letters. Loop has 128 letters. [2020-07-29 01:27:21,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:21,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:27:21,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 128 states and 179 transitions. cyclomatic complexity: 57 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,313 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:27:21,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,314 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:21,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,423 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:21,430 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:21,437 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:21,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {7384#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {7384#unseeded} is VALID [2020-07-29 01:27:21,442 INFO L263 TraceCheckUtils]: 1: Hoare triple {7384#unseeded} call main_#t~ret6 := rec2(main_~x~0); {7384#unseeded} is VALID [2020-07-29 01:27:21,442 INFO L280 TraceCheckUtils]: 2: Hoare triple {7384#unseeded} ~j := #in~j; {7384#unseeded} is VALID [2020-07-29 01:27:21,443 INFO L280 TraceCheckUtils]: 3: Hoare triple {7384#unseeded} assume !(~j <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:21,444 INFO L263 TraceCheckUtils]: 4: Hoare triple {7384#unseeded} call #t~ret3 := rec1(~j); {7384#unseeded} is VALID [2020-07-29 01:27:21,445 INFO L280 TraceCheckUtils]: 5: Hoare triple {7384#unseeded} ~i := #in~i; {7384#unseeded} is VALID [2020-07-29 01:27:21,446 INFO L280 TraceCheckUtils]: 6: Hoare triple {7384#unseeded} assume !(~i <= 0); {7384#unseeded} is VALID [2020-07-29 01:27:21,447 INFO L263 TraceCheckUtils]: 7: Hoare triple {7384#unseeded} call #t~ret0 := rec1(~i - 2); {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,447 INFO L280 TraceCheckUtils]: 8: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,448 INFO L280 TraceCheckUtils]: 9: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,449 INFO L263 TraceCheckUtils]: 10: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,449 INFO L280 TraceCheckUtils]: 11: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,450 INFO L280 TraceCheckUtils]: 12: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,453 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,454 INFO L263 TraceCheckUtils]: 15: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,455 INFO L280 TraceCheckUtils]: 16: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,455 INFO L280 TraceCheckUtils]: 17: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,456 INFO L280 TraceCheckUtils]: 18: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,457 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,459 INFO L263 TraceCheckUtils]: 20: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,459 INFO L280 TraceCheckUtils]: 21: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,460 INFO L280 TraceCheckUtils]: 22: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,460 INFO L280 TraceCheckUtils]: 23: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,462 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,463 INFO L280 TraceCheckUtils]: 25: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,464 INFO L280 TraceCheckUtils]: 26: Hoare triple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:21,465 INFO L275 TraceCheckUtils]: 27: Hoare quadruple {7897#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {7384#unseeded} #27#return; {7384#unseeded} is VALID [2020-07-29 01:27:21,466 INFO L263 TraceCheckUtils]: 28: Hoare triple {7384#unseeded} call #t~ret1 := rec1(#t~ret0 - 1); {7384#unseeded} is VALID [2020-07-29 01:27:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:21,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:21,527 INFO L280 TraceCheckUtils]: 0: Hoare triple {7387#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {7961#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:21,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {7961#(<= rec1_~i oldRank0)} assume !(~i <= 0); {7965#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:21,529 INFO L263 TraceCheckUtils]: 2: Hoare triple {7965#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {7397#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:21,529 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:27:21,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:21,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:21,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,573 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:21,573 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56 Second operand 5 states. [2020-07-29 01:27:21,840 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 111 states and 161 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 156 states and 218 transitions. Complement of second has 13 states. [2020-07-29 01:27:21,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:21,840 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:21,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:21,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 218 transitions. [2020-07-29 01:27:21,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 01:27:21,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:21,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:21,846 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 111 states and 161 transitions. cyclomatic complexity: 56 [2020-07-29 01:27:21,846 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 14 examples of accepted words. [2020-07-29 01:27:21,846 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:21,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:21,847 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:21,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 156 states and 218 transitions. cyclomatic complexity: 68 [2020-07-29 01:27:21,854 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 19 examples of accepted words. [2020-07-29 01:27:21,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 156 letters. Loop has 156 letters. [2020-07-29 01:27:21,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 156 letters. Loop has 156 letters. [2020-07-29 01:27:21,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 156 letters. Loop has 156 letters. [2020-07-29 01:27:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 111 letters. Loop has 111 letters. [2020-07-29 01:27:21,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:21,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:21,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:21,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 45 letters. [2020-07-29 01:27:21,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 73 letters. Loop has 72 letters. [2020-07-29 01:27:21,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:21,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 34 letters. Loop has 3 letters. [2020-07-29 01:27:21,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 34 letters. Loop has 3 letters. [2020-07-29 01:27:21,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 34 letters. Loop has 3 letters. [2020-07-29 01:27:21,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 32 letters. Loop has 3 letters. [2020-07-29 01:27:21,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 32 letters. Loop has 3 letters. [2020-07-29 01:27:21,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 32 letters. Loop has 3 letters. [2020-07-29 01:27:21,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 29 letters. Loop has 72 letters. [2020-07-29 01:27:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 33 letters. Loop has 3 letters. [2020-07-29 01:27:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 33 letters. Loop has 3 letters. [2020-07-29 01:27:21,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 33 letters. Loop has 3 letters. [2020-07-29 01:27:21,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 141 letters. [2020-07-29 01:27:21,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 141 letters. [2020-07-29 01:27:21,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 141 letters. [2020-07-29 01:27:21,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 93 letters. [2020-07-29 01:27:21,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 93 letters. [2020-07-29 01:27:21,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 93 letters. [2020-07-29 01:27:21,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 93 letters. [2020-07-29 01:27:21,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 52 letters. Loop has 141 letters. [2020-07-29 01:27:21,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 27 letters. [2020-07-29 01:27:21,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 27 letters. [2020-07-29 01:27:21,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 27 letters. [2020-07-29 01:27:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 75 letters. [2020-07-29 01:27:21,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 75 letters. [2020-07-29 01:27:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 75 letters. [2020-07-29 01:27:21,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 72 letters. [2020-07-29 01:27:21,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 31 letters. Loop has 24 letters. [2020-07-29 01:27:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 75 letters. Loop has 72 letters. [2020-07-29 01:27:21,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 76 letters. Loop has 72 letters. [2020-07-29 01:27:21,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 74 letters. Loop has 72 letters. [2020-07-29 01:27:21,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 161 transitions. cyclomatic complexity: 56 Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 156 states and 218 transitions. cyclomatic complexity: 68 Stem has 97 letters. Loop has 72 letters. [2020-07-29 01:27:21,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,921 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:21,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:27:21,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:21,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2020-07-29 01:27:21,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2020-07-29 01:27:21,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:21,923 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 218 transitions. cyclomatic complexity: 68 [2020-07-29 01:27:21,930 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2020-07-29 01:27:21,937 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 138 states and 200 transitions. [2020-07-29 01:27:21,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2020-07-29 01:27:21,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2020-07-29 01:27:21,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 138 states and 200 transitions. [2020-07-29 01:27:21,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:21,939 INFO L688 BuchiCegarLoop]: Abstraction has 138 states and 200 transitions. [2020-07-29 01:27:21,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states and 200 transitions. [2020-07-29 01:27:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 119. [2020-07-29 01:27:21,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:21,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states and 200 transitions. Second operand 119 states. [2020-07-29 01:27:21,981 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states and 200 transitions. Second operand 119 states. [2020-07-29 01:27:21,982 INFO L87 Difference]: Start difference. First operand 138 states and 200 transitions. Second operand 119 states. [2020-07-29 01:27:21,982 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:22,024 INFO L93 Difference]: Finished difference Result 380 states and 581 transitions. [2020-07-29 01:27:22,024 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 581 transitions. [2020-07-29 01:27:22,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,030 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 138 states and 200 transitions. [2020-07-29 01:27:22,030 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 138 states and 200 transitions. [2020-07-29 01:27:22,031 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:22,070 INFO L93 Difference]: Finished difference Result 449 states and 687 transitions. [2020-07-29 01:27:22,070 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 687 transitions. [2020-07-29 01:27:22,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:22,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-07-29 01:27:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 169 transitions. [2020-07-29 01:27:22,082 INFO L711 BuchiCegarLoop]: Abstraction has 119 states and 169 transitions. [2020-07-29 01:27:22,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:22,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:27:22,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:27:22,084 INFO L87 Difference]: Start difference. First operand 119 states and 169 transitions. Second operand 8 states. [2020-07-29 01:27:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:22,284 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2020-07-29 01:27:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:27:22,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:27:22,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:22,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 97 states and 115 transitions. [2020-07-29 01:27:22,323 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 97 states to 62 states and 74 transitions. [2020-07-29 01:27:22,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:27:22,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:27:22,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 74 transitions. [2020-07-29 01:27:22,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:27:22,326 INFO L688 BuchiCegarLoop]: Abstraction has 62 states and 74 transitions. [2020-07-29 01:27:22,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 74 transitions. [2020-07-29 01:27:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 53. [2020-07-29 01:27:22,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:27:22,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states and 74 transitions. Second operand 53 states. [2020-07-29 01:27:22,328 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states and 74 transitions. Second operand 53 states. [2020-07-29 01:27:22,328 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand 53 states. [2020-07-29 01:27:22,328 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:22,333 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2020-07-29 01:27:22,333 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2020-07-29 01:27:22,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,334 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 62 states and 74 transitions. [2020-07-29 01:27:22,334 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 62 states and 74 transitions. [2020-07-29 01:27:22,334 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:27:22,338 INFO L93 Difference]: Finished difference Result 109 states and 130 transitions. [2020-07-29 01:27:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 130 transitions. [2020-07-29 01:27:22,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:27:22,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:27:22,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:27:22,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:27:22,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-29 01:27:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2020-07-29 01:27:22,341 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2020-07-29 01:27:22,341 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 64 transitions. [2020-07-29 01:27:22,341 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:27:22,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. [2020-07-29 01:27:22,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:22,342 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:22,342 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:22,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:27:22,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:27:22,343 INFO L794 eck$LassoCheckResult]: Stem: 9668#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; 9639#L25 call main_#t~ret6 := rec2(main_~x~0);< 9638#rec2ENTRY ~j := #in~j; 9640#L18 assume !(~j <= 0); 9670#L20 call #t~ret3 := rec1(~j);< 9688#rec1ENTRY ~i := #in~i; 9686#L12 assume !(~i <= 0); 9657#L14 call #t~ret0 := rec1(~i - 2);< 9684#rec1ENTRY ~i := #in~i; 9687#L12 assume ~i <= 0;#res := 0; 9685#rec1FINAL assume true; 9666#rec1EXIT >#27#return; 9667#L14-1 call #t~ret1 := rec1(#t~ret0 - 1);< 9659#rec1ENTRY ~i := #in~i; 9682#L12 assume ~i <= 0;#res := 0; 9680#rec1FINAL assume true; 9676#rec1EXIT >#29#return; 9675#L14-2 call #t~ret2 := rec1(#t~ret1);< 9665#rec1ENTRY ~i := #in~i; 9678#L12 assume ~i <= 0;#res := 0; 9677#rec1FINAL assume true; 9674#rec1EXIT >#31#return; 9673#L14-3 #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; 9672#rec1FINAL assume true; 9671#rec1EXIT >#33#return; 9642#L20-1 call #t~ret4 := rec2(#t~ret3 - 1);< 9641#rec2ENTRY ~j := #in~j; 9643#L18 assume !(~j <= 0); 9646#L20 call #t~ret3 := rec1(~j);< 9645#rec1ENTRY [2020-07-29 01:27:22,343 INFO L796 eck$LassoCheckResult]: Loop: 9645#rec1ENTRY ~i := #in~i; 9647#L12 assume !(~i <= 0); 9648#L14 call #t~ret0 := rec1(~i - 2);< 9645#rec1ENTRY [2020-07-29 01:27:22,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1852176490, now seen corresponding path program 2 times [2020-07-29 01:27:22,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849880642] [2020-07-29 01:27:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2020-07-29 01:27:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-29 01:27:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10112#true} {10112#true} #27#return; {10112#true} is VALID [2020-07-29 01:27:22,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2020-07-29 01:27:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,470 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,471 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10112#true} {10112#true} #29#return; {10112#true} is VALID [2020-07-29 01:27:22,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2020-07-29 01:27:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,497 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,499 INFO L280 TraceCheckUtils]: 2: Hoare triple {10151#(<= |rec1_#res| 0)} assume true; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,501 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {10151#(<= |rec1_#res| 0)} {10112#true} #31#return; {10149#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:22,501 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {10112#true} assume !(~i <= 0); {10112#true} is VALID [2020-07-29 01:27:22,502 INFO L263 TraceCheckUtils]: 2: Hoare triple {10112#true} call #t~ret0 := rec1(~i - 2); {10112#true} is VALID [2020-07-29 01:27:22,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,502 INFO L280 TraceCheckUtils]: 4: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,503 INFO L280 TraceCheckUtils]: 5: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,503 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {10112#true} {10112#true} #27#return; {10112#true} is VALID [2020-07-29 01:27:22,503 INFO L263 TraceCheckUtils]: 7: Hoare triple {10112#true} call #t~ret1 := rec1(#t~ret0 - 1); {10112#true} is VALID [2020-07-29 01:27:22,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,504 INFO L280 TraceCheckUtils]: 9: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,504 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10112#true} {10112#true} #29#return; {10112#true} is VALID [2020-07-29 01:27:22,505 INFO L263 TraceCheckUtils]: 12: Hoare triple {10112#true} call #t~ret2 := rec1(#t~ret1); {10112#true} is VALID [2020-07-29 01:27:22,505 INFO L280 TraceCheckUtils]: 13: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,507 INFO L280 TraceCheckUtils]: 15: Hoare triple {10151#(<= |rec1_#res| 0)} assume true; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,508 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10151#(<= |rec1_#res| 0)} {10112#true} #31#return; {10149#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:22,509 INFO L280 TraceCheckUtils]: 17: Hoare triple {10149#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,510 INFO L280 TraceCheckUtils]: 18: Hoare triple {10150#(<= |rec1_#res| 1)} assume true; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,511 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {10150#(<= |rec1_#res| 1)} {10112#true} #33#return; {10134#(<= |rec2_#t~ret3| 1)} is VALID [2020-07-29 01:27:22,511 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {10112#true} is VALID [2020-07-29 01:27:22,511 INFO L263 TraceCheckUtils]: 1: Hoare triple {10112#true} call main_#t~ret6 := rec2(main_~x~0); {10112#true} is VALID [2020-07-29 01:27:22,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {10112#true} ~j := #in~j; {10112#true} is VALID [2020-07-29 01:27:22,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {10112#true} assume !(~j <= 0); {10112#true} is VALID [2020-07-29 01:27:22,512 INFO L263 TraceCheckUtils]: 4: Hoare triple {10112#true} call #t~ret3 := rec1(~j); {10112#true} is VALID [2020-07-29 01:27:22,512 INFO L280 TraceCheckUtils]: 5: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {10112#true} assume !(~i <= 0); {10112#true} is VALID [2020-07-29 01:27:22,513 INFO L263 TraceCheckUtils]: 7: Hoare triple {10112#true} call #t~ret0 := rec1(~i - 2); {10112#true} is VALID [2020-07-29 01:27:22,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,514 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10112#true} {10112#true} #27#return; {10112#true} is VALID [2020-07-29 01:27:22,514 INFO L263 TraceCheckUtils]: 12: Hoare triple {10112#true} call #t~ret1 := rec1(#t~ret0 - 1); {10112#true} is VALID [2020-07-29 01:27:22,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,514 INFO L280 TraceCheckUtils]: 15: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,515 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10112#true} {10112#true} #29#return; {10112#true} is VALID [2020-07-29 01:27:22,515 INFO L263 TraceCheckUtils]: 17: Hoare triple {10112#true} call #t~ret2 := rec1(#t~ret1); {10112#true} is VALID [2020-07-29 01:27:22,515 INFO L280 TraceCheckUtils]: 18: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,517 INFO L280 TraceCheckUtils]: 19: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,518 INFO L280 TraceCheckUtils]: 20: Hoare triple {10151#(<= |rec1_#res| 0)} assume true; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,519 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {10151#(<= |rec1_#res| 0)} {10112#true} #31#return; {10149#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:22,520 INFO L280 TraceCheckUtils]: 22: Hoare triple {10149#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,520 INFO L280 TraceCheckUtils]: 23: Hoare triple {10150#(<= |rec1_#res| 1)} assume true; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,522 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10150#(<= |rec1_#res| 1)} {10112#true} #33#return; {10134#(<= |rec2_#t~ret3| 1)} is VALID [2020-07-29 01:27:22,524 INFO L263 TraceCheckUtils]: 25: Hoare triple {10134#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {10135#(<= |rec2_#in~j| 0)} is VALID [2020-07-29 01:27:22,525 INFO L280 TraceCheckUtils]: 26: Hoare triple {10135#(<= |rec2_#in~j| 0)} ~j := #in~j; {10136#(<= rec2_~j 0)} is VALID [2020-07-29 01:27:22,525 INFO L280 TraceCheckUtils]: 27: Hoare triple {10136#(<= rec2_~j 0)} assume !(~j <= 0); {10113#false} is VALID [2020-07-29 01:27:22,526 INFO L263 TraceCheckUtils]: 28: Hoare triple {10113#false} call #t~ret3 := rec1(~j); {10113#false} is VALID [2020-07-29 01:27:22,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-29 01:27:22,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849880642] [2020-07-29 01:27:22,528 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687940945] [2020-07-29 01:27:22,528 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:27:22,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:27:22,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:27:22,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:22,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:22,732 INFO L280 TraceCheckUtils]: 0: Hoare triple {10112#true} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {10112#true} is VALID [2020-07-29 01:27:22,732 INFO L263 TraceCheckUtils]: 1: Hoare triple {10112#true} call main_#t~ret6 := rec2(main_~x~0); {10112#true} is VALID [2020-07-29 01:27:22,732 INFO L280 TraceCheckUtils]: 2: Hoare triple {10112#true} ~j := #in~j; {10112#true} is VALID [2020-07-29 01:27:22,733 INFO L280 TraceCheckUtils]: 3: Hoare triple {10112#true} assume !(~j <= 0); {10112#true} is VALID [2020-07-29 01:27:22,733 INFO L263 TraceCheckUtils]: 4: Hoare triple {10112#true} call #t~ret3 := rec1(~j); {10112#true} is VALID [2020-07-29 01:27:22,733 INFO L280 TraceCheckUtils]: 5: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,733 INFO L280 TraceCheckUtils]: 6: Hoare triple {10112#true} assume !(~i <= 0); {10112#true} is VALID [2020-07-29 01:27:22,733 INFO L263 TraceCheckUtils]: 7: Hoare triple {10112#true} call #t~ret0 := rec1(~i - 2); {10112#true} is VALID [2020-07-29 01:27:22,734 INFO L280 TraceCheckUtils]: 8: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,734 INFO L280 TraceCheckUtils]: 9: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,734 INFO L280 TraceCheckUtils]: 10: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,736 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10112#true} {10112#true} #27#return; {10112#true} is VALID [2020-07-29 01:27:22,736 INFO L263 TraceCheckUtils]: 12: Hoare triple {10112#true} call #t~ret1 := rec1(#t~ret0 - 1); {10112#true} is VALID [2020-07-29 01:27:22,736 INFO L280 TraceCheckUtils]: 13: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,736 INFO L280 TraceCheckUtils]: 14: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10112#true} is VALID [2020-07-29 01:27:22,737 INFO L280 TraceCheckUtils]: 15: Hoare triple {10112#true} assume true; {10112#true} is VALID [2020-07-29 01:27:22,737 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10112#true} {10112#true} #29#return; {10112#true} is VALID [2020-07-29 01:27:22,737 INFO L263 TraceCheckUtils]: 17: Hoare triple {10112#true} call #t~ret2 := rec1(#t~ret1); {10112#true} is VALID [2020-07-29 01:27:22,737 INFO L280 TraceCheckUtils]: 18: Hoare triple {10112#true} ~i := #in~i; {10112#true} is VALID [2020-07-29 01:27:22,746 INFO L280 TraceCheckUtils]: 19: Hoare triple {10112#true} assume ~i <= 0;#res := 0; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,747 INFO L280 TraceCheckUtils]: 20: Hoare triple {10151#(<= |rec1_#res| 0)} assume true; {10151#(<= |rec1_#res| 0)} is VALID [2020-07-29 01:27:22,748 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {10151#(<= |rec1_#res| 0)} {10112#true} #31#return; {10149#(<= |rec1_#t~ret2| 0)} is VALID [2020-07-29 01:27:22,749 INFO L280 TraceCheckUtils]: 22: Hoare triple {10149#(<= |rec1_#t~ret2| 0)} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,749 INFO L280 TraceCheckUtils]: 23: Hoare triple {10150#(<= |rec1_#res| 1)} assume true; {10150#(<= |rec1_#res| 1)} is VALID [2020-07-29 01:27:22,750 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10150#(<= |rec1_#res| 1)} {10112#true} #33#return; {10134#(<= |rec2_#t~ret3| 1)} is VALID [2020-07-29 01:27:22,751 INFO L263 TraceCheckUtils]: 25: Hoare triple {10134#(<= |rec2_#t~ret3| 1)} call #t~ret4 := rec2(#t~ret3 - 1); {10135#(<= |rec2_#in~j| 0)} is VALID [2020-07-29 01:27:22,752 INFO L280 TraceCheckUtils]: 26: Hoare triple {10135#(<= |rec2_#in~j| 0)} ~j := #in~j; {10136#(<= rec2_~j 0)} is VALID [2020-07-29 01:27:22,752 INFO L280 TraceCheckUtils]: 27: Hoare triple {10136#(<= rec2_~j 0)} assume !(~j <= 0); {10113#false} is VALID [2020-07-29 01:27:22,752 INFO L263 TraceCheckUtils]: 28: Hoare triple {10113#false} call #t~ret3 := rec1(~j); {10113#false} is VALID [2020-07-29 01:27:22,753 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-29 01:27:22,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:27:22,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-29 01:27:22,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446259455] [2020-07-29 01:27:22,754 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:27:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 29941, now seen corresponding path program 4 times [2020-07-29 01:27:22,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:27:22,755 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297312802] [2020-07-29 01:27:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:27:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:27:22,761 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:27:22,763 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:27:22,820 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:22,820 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:22,820 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:22,820 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:22,820 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:27:22,820 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:22,820 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:22,820 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:22,821 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2020-07-29 01:27:22,821 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:22,821 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:22,827 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:27:22,834 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:27:22,838 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:27:22,841 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:27:22,845 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:27:22,849 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:27:22,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:22,952 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:27:22,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:27:22,955 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 47 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:27:22,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:27:22,986 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:23,011 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:27:23,013 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:27:23,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:27:23,013 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:27:23,013 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:27:23,013 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:27:23,013 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:27:23,013 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:27:23,014 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:27:23,014 INFO L133 ssoRankerPreferences]: Filename of dumped script: NestedRecursion_1d.c_Iteration7_Loop [2020-07-29 01:27:23,014 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:27:23,014 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:27:23,017 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:27:23,025 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:27:23,029 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:27:23,034 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:27:23,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:27:23,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:27:23,141 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:27:23,141 INFO L489 LassoAnalysis]: Using template 'affine'. 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:27:23,144 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:27:23,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:27:23,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:27:23,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:27:23,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:27:23,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:27:23,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:27:23,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:27:23,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:27:23,156 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:27:23,157 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 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:27:23,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:27:23,160 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:27:23,160 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:27:23,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(rec1_#in~i) = 1*rec1_#in~i Supporting invariants [] [2020-07-29 01:27:23,182 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:27:23,185 INFO L393 LassoCheck]: Loop: "~i := #in~i;" "assume !(~i <= 0);" "call #t~ret0 := rec1(~i - 2);"< [2020-07-29 01:27:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:23,322 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,329 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,343 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,352 INFO L280 TraceCheckUtils]: 0: Hoare triple {10238#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {10238#unseeded} is VALID [2020-07-29 01:27:23,353 INFO L263 TraceCheckUtils]: 1: Hoare triple {10238#unseeded} call main_#t~ret6 := rec2(main_~x~0); {10238#unseeded} is VALID [2020-07-29 01:27:23,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:23,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:23,355 INFO L263 TraceCheckUtils]: 4: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,356 INFO L280 TraceCheckUtils]: 5: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,358 INFO L263 TraceCheckUtils]: 7: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,359 INFO L280 TraceCheckUtils]: 9: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,360 INFO L280 TraceCheckUtils]: 10: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,361 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,362 INFO L263 TraceCheckUtils]: 12: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,363 INFO L280 TraceCheckUtils]: 13: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,364 INFO L280 TraceCheckUtils]: 14: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,364 INFO L280 TraceCheckUtils]: 15: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,366 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,367 INFO L263 TraceCheckUtils]: 17: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,367 INFO L280 TraceCheckUtils]: 18: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,368 INFO L280 TraceCheckUtils]: 19: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,369 INFO L280 TraceCheckUtils]: 20: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,370 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,371 INFO L280 TraceCheckUtils]: 22: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,372 INFO L280 TraceCheckUtils]: 23: Hoare triple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,373 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10268#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10238#unseeded} #33#return; {10238#unseeded} is VALID [2020-07-29 01:27:23,374 INFO L263 TraceCheckUtils]: 25: Hoare triple {10238#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10238#unseeded} is VALID [2020-07-29 01:27:23,374 INFO L280 TraceCheckUtils]: 26: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:23,375 INFO L280 TraceCheckUtils]: 27: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:23,375 INFO L263 TraceCheckUtils]: 28: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10238#unseeded} is VALID [2020-07-29 01:27:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:23,451 INFO L280 TraceCheckUtils]: 0: Hoare triple {10241#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10341#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:23,452 INFO L280 TraceCheckUtils]: 1: Hoare triple {10341#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10345#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:23,453 INFO L263 TraceCheckUtils]: 2: Hoare triple {10345#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10251#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:23,454 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:27:23,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:23,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:23,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,502 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:23,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-29 01:27:23,628 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2020-07-29 01:27:23,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:23,628 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:23,628 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:23,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:23,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:23,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:23,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,629 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:23,629 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:23,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 75 transitions. [2020-07-29 01:27:23,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:23,631 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:23,631 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:23,632 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:23,632 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:23,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:23,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:23,633 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 75 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:23,633 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:23,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:23,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:23,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:23,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:23,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:23,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:23,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:23,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:23,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:23,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:23,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:23,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:23,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,647 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:23,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:23,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-07-29 01:27:23,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,649 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:23,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:23,768 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,781 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,792 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:23,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {10238#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {10238#unseeded} is VALID [2020-07-29 01:27:23,802 INFO L263 TraceCheckUtils]: 1: Hoare triple {10238#unseeded} call main_#t~ret6 := rec2(main_~x~0); {10238#unseeded} is VALID [2020-07-29 01:27:23,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:23,803 INFO L280 TraceCheckUtils]: 3: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:23,803 INFO L263 TraceCheckUtils]: 4: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,804 INFO L280 TraceCheckUtils]: 5: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,804 INFO L280 TraceCheckUtils]: 6: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,806 INFO L263 TraceCheckUtils]: 7: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,809 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,810 INFO L263 TraceCheckUtils]: 12: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,811 INFO L280 TraceCheckUtils]: 13: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,811 INFO L280 TraceCheckUtils]: 14: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,812 INFO L280 TraceCheckUtils]: 15: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,813 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,814 INFO L263 TraceCheckUtils]: 17: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,815 INFO L280 TraceCheckUtils]: 18: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,816 INFO L280 TraceCheckUtils]: 19: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,817 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,819 INFO L280 TraceCheckUtils]: 23: Hoare triple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:23,820 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10448#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10238#unseeded} #33#return; {10238#unseeded} is VALID [2020-07-29 01:27:23,821 INFO L263 TraceCheckUtils]: 25: Hoare triple {10238#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10238#unseeded} is VALID [2020-07-29 01:27:23,822 INFO L280 TraceCheckUtils]: 26: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:23,823 INFO L280 TraceCheckUtils]: 27: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:23,824 INFO L263 TraceCheckUtils]: 28: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10238#unseeded} is VALID [2020-07-29 01:27:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:23,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:23,900 INFO L280 TraceCheckUtils]: 0: Hoare triple {10241#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10521#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:23,901 INFO L280 TraceCheckUtils]: 1: Hoare triple {10521#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10525#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:23,902 INFO L263 TraceCheckUtils]: 2: Hoare triple {10525#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10251#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:23,902 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:27:23,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:23,952 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:23,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:23,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:23,953 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:23,953 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-29 01:27:24,093 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 63 states and 75 transitions. Complement of second has 13 states. [2020-07-29 01:27:24,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:24,094 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:24,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:24,094 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,094 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:24,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,095 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,096 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 63 states and 75 transitions. [2020-07-29 01:27:24,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,097 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:24,097 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:24,097 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:24,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,098 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:24,098 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 63 states and 75 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:24,098 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:24,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 63 letters. Loop has 63 letters. [2020-07-29 01:27:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 63 states and 75 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,108 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-07-29 01:27:24,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,109 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:27:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:27:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 16 conjunts are in the unsatisfiable core [2020-07-29 01:27:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:24,222 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:24,230 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:24,239 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-29 01:27:24,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {10238#unseeded} havoc main_#res;havoc main_#t~nondet5, main_#t~ret6, main_~x~0;main_~x~0 := main_#t~nondet5;havoc main_#t~nondet5; {10238#unseeded} is VALID [2020-07-29 01:27:24,247 INFO L263 TraceCheckUtils]: 1: Hoare triple {10238#unseeded} call main_#t~ret6 := rec2(main_~x~0); {10238#unseeded} is VALID [2020-07-29 01:27:24,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:24,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:24,249 INFO L263 TraceCheckUtils]: 4: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,249 INFO L280 TraceCheckUtils]: 5: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,250 INFO L280 TraceCheckUtils]: 6: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume !(~i <= 0); {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,250 INFO L263 TraceCheckUtils]: 7: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret0 := rec1(~i - 2); {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,251 INFO L280 TraceCheckUtils]: 8: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,254 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #27#return; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,255 INFO L263 TraceCheckUtils]: 12: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret1 := rec1(#t~ret0 - 1); {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,255 INFO L280 TraceCheckUtils]: 13: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,256 INFO L280 TraceCheckUtils]: 14: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,258 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #29#return; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,259 INFO L263 TraceCheckUtils]: 17: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} call #t~ret2 := rec1(#t~ret1); {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,260 INFO L280 TraceCheckUtils]: 18: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} ~i := #in~i; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,260 INFO L280 TraceCheckUtils]: 19: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume ~i <= 0;#res := 0; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,261 INFO L280 TraceCheckUtils]: 20: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,262 INFO L275 TraceCheckUtils]: 21: Hoare quadruple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #31#return; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,263 INFO L280 TraceCheckUtils]: 22: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} #res := 1 + #t~ret2;havoc #t~ret2;havoc #t~ret1;havoc #t~ret0; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,263 INFO L280 TraceCheckUtils]: 23: Hoare triple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} assume true; {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} is VALID [2020-07-29 01:27:24,264 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {10628#(or (and |old(unseeded)| unseeded) (and (not unseeded) (not |old(unseeded)|)))} {10238#unseeded} #33#return; {10238#unseeded} is VALID [2020-07-29 01:27:24,265 INFO L263 TraceCheckUtils]: 25: Hoare triple {10238#unseeded} call #t~ret4 := rec2(#t~ret3 - 1); {10238#unseeded} is VALID [2020-07-29 01:27:24,266 INFO L280 TraceCheckUtils]: 26: Hoare triple {10238#unseeded} ~j := #in~j; {10238#unseeded} is VALID [2020-07-29 01:27:24,266 INFO L280 TraceCheckUtils]: 27: Hoare triple {10238#unseeded} assume !(~j <= 0); {10238#unseeded} is VALID [2020-07-29 01:27:24,267 INFO L263 TraceCheckUtils]: 28: Hoare triple {10238#unseeded} call #t~ret3 := rec1(~j); {10238#unseeded} is VALID [2020-07-29 01:27:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 01:27:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:27:24,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:27:24,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {10241#(>= oldRank0 |rec1_#in~i|)} ~i := #in~i; {10701#(<= rec1_~i oldRank0)} is VALID [2020-07-29 01:27:24,326 INFO L280 TraceCheckUtils]: 1: Hoare triple {10701#(<= rec1_~i oldRank0)} assume !(~i <= 0); {10705#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} is VALID [2020-07-29 01:27:24,328 INFO L263 TraceCheckUtils]: 2: Hoare triple {10705#(and (< 0 rec1_~i) (<= rec1_~i oldRank0))} call #t~ret0 := rec1(~i - 2); {10251#(or (and (> oldRank0 |rec1_#in~i|) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:27:24,328 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:27:24,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:27:24,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:24,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,367 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-29 01:27:24,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15 Second operand 5 states. [2020-07-29 01:27:24,579 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 64 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 77 states and 89 transitions. Complement of second has 13 states. [2020-07-29 01:27:24,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:27:24,579 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:24,579 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:24,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,580 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states. [2020-07-29 01:27:24,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:27:24,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:27:24,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 89 transitions. [2020-07-29 01:27:24,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:24,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:24,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 64 transitions. cyclomatic complexity: 15 [2020-07-29 01:27:24,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:27:24,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states. [2020-07-29 01:27:24,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:27:24,583 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:27:24,583 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 77 states and 89 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:24,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 89 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:24,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:24,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:27:24,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:27:24,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:27:24,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 77 letters. Loop has 77 letters. [2020-07-29 01:27:24,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 53 letters. Loop has 53 letters. [2020-07-29 01:27:24,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:27:24,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 31 letters. Loop has 3 letters. [2020-07-29 01:27:24,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 30 letters. Loop has 3 letters. [2020-07-29 01:27:24,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 64 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 77 states and 89 transitions. cyclomatic complexity: 16 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:27:24,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,594 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:27:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:27:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-29 01:27:24,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 3 letters. [2020-07-29 01:27:24,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 32 letters. Loop has 3 letters. [2020-07-29 01:27:24,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 29 letters. Loop has 6 letters. [2020-07-29 01:27:24,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:27:24,596 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 89 transitions. cyclomatic complexity: 16 [2020-07-29 01:27:24,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:24,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2020-07-29 01:27:24,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:27:24,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:27:24,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:27:24,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:24,600 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:24,600 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:24,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:27:24,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:27:24,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:27:24,601 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 8 states. [2020-07-29 01:27:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:27:24,601 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:27:24,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:27:24,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:27:24,638 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:27:24,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:27:24,638 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:24,638 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:27:24,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:27:24,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:27:24,639 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:27:24,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:27:24,639 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:27:24,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:27:24,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:27:24 BoogieIcfgContainer [2020-07-29 01:27:24,648 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:27:24,649 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:27:24,649 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:27:24,649 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:27:24,650 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:27:10" (3/4) ... [2020-07-29 01:27:24,654 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:27:24,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:27:24,656 INFO L168 Benchmark]: Toolchain (without parser) took 14401.13 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 957.5 MB in the beginning and 924.8 MB in the end (delta: 32.8 MB). Peak memory consumption was 404.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:24,657 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:24,657 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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:27:24,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:24,658 INFO L168 Benchmark]: Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:27:24,659 INFO L168 Benchmark]: RCFGBuilder took 290.54 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:24,659 INFO L168 Benchmark]: BuchiAutomizer took 13743.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 934.2 MB in the end (delta: 187.4 MB). Peak memory consumption was 408.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:24,660 INFO L168 Benchmark]: Witness Printer took 5.39 ms. Allocated memory is still 1.4 GB. Free memory was 934.2 MB in the beginning and 924.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:27:24,662 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 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.87 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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 89.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 150.5 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -200.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.75 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.54 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: 25.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13743.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 934.2 MB in the end (delta: 187.4 MB). Peak memory consumption was 408.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.39 ms. Allocated memory is still 1.4 GB. Free memory was 934.2 MB in the beginning and 924.8 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. 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 10 terminating modules (5 trivial, 3 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(j) and consists of 10 locations. One deterministic module has affine ranking function \old(i) and consists of 4 locations. One deterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. One nondeterministic module has affine ranking function \old(i) and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 8 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 5.7s. Construction of modules took 1.0s. Büchi inclusion checks took 5.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 7. Automata minimization 0.7s AutomataMinimizationTime, 8 MinimizatonAttempts, 89 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 111 states and ocurred in iteration 5. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 22/24 HoareTripleCheckerStatistics: 187 SDtfs, 199 SDslu, 301 SDs, 0 SdLazy, 311 SolverSat, 194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf91 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq155 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...