./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:20,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:20,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:20,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:20,109 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:20,111 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:20,114 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:20,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:20,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:20,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:20,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:20,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:20,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:20,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:20,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:20,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:20,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:20,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:20,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:20,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:20,157 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:20,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:20,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:20,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:20,169 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:20,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:20,170 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:20,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:20,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:20,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:20,174 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:20,175 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:20,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:20,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:20,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:20,179 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:20,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:20,180 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:20,180 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:20,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:20,181 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:20,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:20,201 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:20,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:20,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:20,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:20,203 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:20,204 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:20,204 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:20,204 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:20,205 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:20,205 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:20,205 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:20,205 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:20,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:20,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:20,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:20,207 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:20,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:20,207 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:20,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:20,208 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:20,208 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:20,208 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:20,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:20,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:20,210 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:20,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:20,210 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:20,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:20,211 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:20,212 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:20,212 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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2020-07-29 01:28:20,528 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:20,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:20,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:20,547 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:20,548 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:20,549 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:28:20,627 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f9e6822/b3fb56a6afec414484f61db2fa95f012/FLAG834672c8e [2020-07-29 01:28:21,066 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:21,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:28:21,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f9e6822/b3fb56a6afec414484f61db2fa95f012/FLAG834672c8e [2020-07-29 01:28:21,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f9e6822/b3fb56a6afec414484f61db2fa95f012 [2020-07-29 01:28:21,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:21,450 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:21,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:21,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:21,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:21,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@466ce97c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21, skipping insertion in model container [2020-07-29 01:28:21,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:21,494 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:21,715 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:21,720 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:21,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:21,755 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:21,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21 WrapperNode [2020-07-29 01:28:21,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:21,757 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:21,758 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:21,758 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:21,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,773 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,852 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:21,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:21,853 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:21,853 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:21,861 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,861 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,862 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,871 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... [2020-07-29 01:28:21,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:21,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:21,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:21,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:21,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:21,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:21,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:22,245 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:22,246 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 01:28:22,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:22 BoogieIcfgContainer [2020-07-29 01:28:22,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:22,253 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:22,253 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:22,267 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:22,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:22,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:21" (1/3) ... [2020-07-29 01:28:22,270 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b14c346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:22, skipping insertion in model container [2020-07-29 01:28:22,270 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:22,270 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:21" (2/3) ... [2020-07-29 01:28:22,271 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b14c346 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:22, skipping insertion in model container [2020-07-29 01:28:22,271 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:22,271 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:22" (3/3) ... [2020-07-29 01:28:22,277 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c [2020-07-29 01:28:22,331 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:22,332 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:22,332 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:22,332 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:22,333 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:22,333 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:22,333 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:22,333 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:22,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:22,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:22,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:22,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:22,376 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:22,377 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:22,377 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:22,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:22,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:22,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:22,380 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:22,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:22,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:22,387 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 5#L23-2true [2020-07-29 01:28:22,388 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 8#L25-2true assume !(main_~j~0 < main_~m~0); 7#L25-3true main_~i~0 := 1 + main_~i~0; 5#L23-2true [2020-07-29 01:28:22,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:22,394 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:22,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:22,403 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729857536] [2020-07-29 01:28:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,477 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,485 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,501 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:22,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:22,503 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2020-07-29 01:28:22,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:22,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987659072] [2020-07-29 01:28:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,525 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:22,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:22,527 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2020-07-29 01:28:22,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:22,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943849235] [2020-07-29 01:28:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:22,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:22,554 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:22,628 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:22,629 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:22,629 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:22,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:22,630 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:22,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:22,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:22,631 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:22,631 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2020-07-29 01:28:22,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:22,632 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:22,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:22,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:28:22,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:22,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:22,884 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:22,885 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:22,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:22,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:22,902 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:22,903 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:22,942 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:22,943 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:22,947 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:22,947 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:22,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:22,974 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:23,006 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:23,169 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:23,171 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:23,171 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:23,171 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:23,171 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:23,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:23,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,172 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:23,172 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:23,172 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration1_Loop [2020-07-29 01:28:23,172 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:23,172 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:23,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:23,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:23,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:23,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:23,396 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:23,404 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:23,410 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:23,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:23,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:23,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:23,414 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:23,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:23,432 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:23,471 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:23,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:23,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:23,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:23,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:23,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:23,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,484 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:23,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:23,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:23,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:23,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:23,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:23,534 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:23,535 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:23,538 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:23,548 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:23,548 INFO L444 ModelExtractionUtils]: 1 out of 4 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:23,562 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:23,563 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:23,563 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:23,564 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,609 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:23,612 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" "assume !(main_~j~0 < main_~m~0);" "main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:28:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:23,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:23,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:23,686 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {21#unseeded} is VALID [2020-07-29 01:28:23,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {21#unseeded} is VALID [2020-07-29 01:28:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:23,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:23,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:23,731 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {42#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:23,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {42#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 < main_~m~0); {42#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:23,734 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} main_~i~0 := 1 + main_~i~0; {34#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:23,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:23,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:23,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,775 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:23,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2020-07-29 01:28:23,888 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2020-07-29 01:28:23,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:23,888 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:23,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 01:28:23,891 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:23,891 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:23,892 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:23,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:23,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:23,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:23,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:23,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 62 transitions. [2020-07-29 01:28:23,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:23,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:23,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:23,903 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 01:28:23,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:23,907 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:23,907 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:23,910 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:23,911 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:23,911 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 42 states and 62 transitions. cyclomatic complexity: 25 [2020-07-29 01:28:23,913 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:23,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:23,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:23,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 42 letters. Loop has 42 letters. [2020-07-29 01:28:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:23,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:23,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:23,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:23,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:23,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:23,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:23,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:23,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:23,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:23,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:23,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:23,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:23,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:23,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:23,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:23,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:23,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:23,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:23,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:23,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:23,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:23,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:23,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:23,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:23,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:23,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:23,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:23,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 42 states and 62 transitions. cyclomatic complexity: 25 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:23,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,947 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:23,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:28:23,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:23,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:23,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:28:23,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:23,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. cyclomatic complexity: 25 [2020-07-29 01:28:23,960 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:23,966 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2020-07-29 01:28:23,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:28:23,968 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:28:23,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2020-07-29 01:28:23,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:23,970 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2020-07-29 01:28:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2020-07-29 01:28:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2020-07-29 01:28:24,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:24,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 21 transitions. Second operand 13 states. [2020-07-29 01:28:24,002 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 21 transitions. Second operand 13 states. [2020-07-29 01:28:24,006 INFO L87 Difference]: Start difference. First operand 14 states and 21 transitions. Second operand 13 states. [2020-07-29 01:28:24,010 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:24,014 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-29 01:28:24,015 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:28:24,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:24,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:24,016 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 14 states and 21 transitions. [2020-07-29 01:28:24,016 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 14 states and 21 transitions. [2020-07-29 01:28:24,017 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:24,019 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2020-07-29 01:28:24,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 21 transitions. [2020-07-29 01:28:24,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:24,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:24,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:24,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:28:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2020-07-29 01:28:24,024 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-07-29 01:28:24,024 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2020-07-29 01:28:24,024 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:24,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 01:28:24,025 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:24,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:24,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:24,026 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:28:24,026 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:24,027 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 109#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 110#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 108#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 102#L28-2 [2020-07-29 01:28:24,027 INFO L796 eck$LassoCheckResult]: Loop: 102#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 102#L28-2 [2020-07-29 01:28:24,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2020-07-29 01:28:24,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:24,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794340861] [2020-07-29 01:28:24,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,047 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,050 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:24,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:24,051 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2020-07-29 01:28:24,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:24,051 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793091513] [2020-07-29 01:28:24,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,056 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,061 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:24,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:24,062 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2020-07-29 01:28:24,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:24,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846887965] [2020-07-29 01:28:24,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,073 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:24,093 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:24,096 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:24,111 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:24,112 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:24,112 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:24,112 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:24,112 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:24,112 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,113 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:24,113 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:24,113 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2020-07-29 01:28:24,113 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:24,113 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:24,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:28:24,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,236 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:24,236 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,241 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,241 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,246 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:24,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,305 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,313 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:24,313 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,378 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 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 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:28:24,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:24,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:24,603 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:24,606 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:24,606 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:24,606 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:24,606 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:24,606 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:24,606 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,607 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:24,607 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:24,607 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration2_Loop [2020-07-29 01:28:24,607 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:24,607 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:24,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,736 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:24,737 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:24,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:24,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:24,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:24,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:24,766 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:24,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,772 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:24,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:24,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:24,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:24,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:24,827 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:24,829 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:24,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:24,889 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:24,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:24,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:24,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:24,893 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:24,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,897 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:24,900 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:24,900 INFO L444 ModelExtractionUtils]: 1 out of 4 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,913 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:24,913 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:24,913 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:24,914 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,950 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:24,954 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0;" [2020-07-29 01:28:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:24,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:24,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:24,991 INFO L280 TraceCheckUtils]: 0: Hoare triple {187#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {187#unseeded} is VALID [2020-07-29 01:28:24,991 INFO L280 TraceCheckUtils]: 1: Hoare triple {187#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {187#unseeded} is VALID [2020-07-29 01:28:24,992 INFO L280 TraceCheckUtils]: 2: Hoare triple {187#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {187#unseeded} is VALID [2020-07-29 01:28:24,993 INFO L280 TraceCheckUtils]: 3: Hoare triple {187#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {187#unseeded} is VALID [2020-07-29 01:28:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:24,997 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:25,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {190#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0))} assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; {200#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:25,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:25,012 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:25,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,013 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:25,013 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2020-07-29 01:28:25,065 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 27 states and 43 transitions. Complement of second has 6 states. [2020-07-29 01:28:25,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:25,067 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:25,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:25,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:25,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:25,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,072 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 43 transitions. [2020-07-29 01:28:25,073 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:28:25,075 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,075 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,076 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:25,078 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:25,078 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:25,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:25,081 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:25,081 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 27 states and 43 transitions. cyclomatic complexity: 22 [2020-07-29 01:28:25,085 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:28:25,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:25,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:25,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 27 letters. Loop has 27 letters. [2020-07-29 01:28:25,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:25,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:25,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:25,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:25,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:25,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:25,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:25,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:25,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:25,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:25,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:25,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:25,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:25,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:25,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:25,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:25,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:25,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:25,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:25,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:25,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 27 states and 43 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:25,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,127 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2020-07-29 01:28:25,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2020-07-29 01:28:25,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2020-07-29 01:28:25,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. cyclomatic complexity: 22 [2020-07-29 01:28:25,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:28:25,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2020-07-29 01:28:25,147 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:28:25,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-07-29 01:28:25,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2020-07-29 01:28:25,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:25,148 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:28:25,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2020-07-29 01:28:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-29 01:28:25,152 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:25,152 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 27 transitions. Second operand 18 states. [2020-07-29 01:28:25,153 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 27 transitions. Second operand 18 states. [2020-07-29 01:28:25,153 INFO L87 Difference]: Start difference. First operand 18 states and 27 transitions. Second operand 18 states. [2020-07-29 01:28:25,153 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:25,155 INFO L93 Difference]: Finished difference Result 18 states and 27 transitions. [2020-07-29 01:28:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-07-29 01:28:25,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:25,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:25,156 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states and 27 transitions. [2020-07-29 01:28:25,156 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states and 27 transitions. [2020-07-29 01:28:25,157 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:25,159 INFO L93 Difference]: Finished difference Result 18 states and 27 transitions. [2020-07-29 01:28:25,160 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 27 transitions. [2020-07-29 01:28:25,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:25,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:25,161 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:25,161 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:25,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-29 01:28:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2020-07-29 01:28:25,163 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:28:25,163 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2020-07-29 01:28:25,164 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:25,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2020-07-29 01:28:25,165 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-29 01:28:25,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,166 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 01:28:25,166 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:25,167 INFO L794 eck$LassoCheckResult]: Stem: 260#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 259#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 257#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 265#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 252#L28-3 main_~i~0 := main_~k~0; 263#L25-2 [2020-07-29 01:28:25,167 INFO L796 eck$LassoCheckResult]: Loop: 263#L25-2 assume !(main_~j~0 < main_~m~0); 264#L25-3 main_~i~0 := 1 + main_~i~0; 266#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 263#L25-2 [2020-07-29 01:28:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,168 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2020-07-29 01:28:25,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:25,169 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718303185] [2020-07-29 01:28:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,189 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,212 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,222 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2020-07-29 01:28:25,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:25,223 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792310573] [2020-07-29 01:28:25,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,228 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,235 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,236 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2020-07-29 01:28:25,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:25,237 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251329564] [2020-07-29 01:28:25,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,248 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,259 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:25,305 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:25,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:25,306 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:25,306 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:25,306 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:25,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,306 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:25,306 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:25,306 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2020-07-29 01:28:25,306 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:25,307 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:25,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,535 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:25,535 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:25,543 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,543 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:25,548 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:25,548 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,573 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:25,576 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:25,577 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:28:25,604 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,604 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:25,607 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,631 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,632 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:25,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:25,918 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:25,920 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:25,920 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:25,920 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:25,920 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:25,920 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:25,920 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,920 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:25,920 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:25,920 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration3_Loop [2020-07-29 01:28:25,921 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:25,921 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:25,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:26,073 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,081 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:26,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,082 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:26,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:26,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,115 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:26,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:26,119 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 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:28:26,143 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,144 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:26,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:26,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:26,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:26,158 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:26,158 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:26,161 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:26,161 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:26,161 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:26,161 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,186 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:26,188 INFO L393 LassoCheck]: Loop: "assume !(main_~j~0 < main_~m~0);" "main_~i~0 := 1 + main_~i~0;" "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" [2020-07-29 01:28:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:26,222 INFO L280 TraceCheckUtils]: 0: Hoare triple {356#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {356#unseeded} is VALID [2020-07-29 01:28:26,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {356#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {356#unseeded} is VALID [2020-07-29 01:28:26,223 INFO L280 TraceCheckUtils]: 2: Hoare triple {356#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {356#unseeded} is VALID [2020-07-29 01:28:26,224 INFO L280 TraceCheckUtils]: 3: Hoare triple {356#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {356#unseeded} is VALID [2020-07-29 01:28:26,224 INFO L280 TraceCheckUtils]: 4: Hoare triple {356#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {356#unseeded} is VALID [2020-07-29 01:28:26,225 INFO L280 TraceCheckUtils]: 5: Hoare triple {356#unseeded} main_~i~0 := main_~k~0; {356#unseeded} is VALID [2020-07-29 01:28:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,229 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:26,346 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0))} assume !(main_~j~0 < main_~m~0); {359#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:26,347 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0))} main_~i~0 := 1 + main_~i~0; {392#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:26,349 INFO L280 TraceCheckUtils]: 2: Hoare triple {392#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {369#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~n~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:26,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:26,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,365 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:26,365 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2020-07-29 01:28:26,433 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 8 states. [2020-07-29 01:28:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:26,433 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:26,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:26,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,434 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:26,435 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:26,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 51 transitions. [2020-07-29 01:28:26,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:26,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,441 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 27 transitions. cyclomatic complexity: 13 [2020-07-29 01:28:26,443 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 8 examples of accepted words. [2020-07-29 01:28:26,444 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:26,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:26,447 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:26,447 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 51 transitions. cyclomatic complexity: 27 [2020-07-29 01:28:26,448 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:28:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:28:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:28:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:28:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:28:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 27 transitions. cyclomatic complexity: 13 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 51 transitions. cyclomatic complexity: 27 Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,473 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-29 01:28:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. cyclomatic complexity: 27 [2020-07-29 01:28:26,477 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:26,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2020-07-29 01:28:26,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-07-29 01:28:26,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-07-29 01:28:26,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2020-07-29 01:28:26,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:26,479 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-29 01:28:26,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2020-07-29 01:28:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 01:28:26,484 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:26,484 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 34 transitions. Second operand 20 states. [2020-07-29 01:28:26,485 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 34 transitions. Second operand 20 states. [2020-07-29 01:28:26,485 INFO L87 Difference]: Start difference. First operand 22 states and 34 transitions. Second operand 20 states. [2020-07-29 01:28:26,485 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,487 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2020-07-29 01:28:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-29 01:28:26,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,487 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 34 transitions. [2020-07-29 01:28:26,488 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 34 transitions. [2020-07-29 01:28:26,488 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,491 INFO L93 Difference]: Finished difference Result 22 states and 34 transitions. [2020-07-29 01:28:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 34 transitions. [2020-07-29 01:28:26,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:26,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:28:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2020-07-29 01:28:26,493 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-29 01:28:26,494 INFO L591 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2020-07-29 01:28:26,494 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:26,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2020-07-29 01:28:26,494 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:26,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,496 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:26,496 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:28:26,496 INFO L794 eck$LassoCheckResult]: Stem: 448#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 446#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 447#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 453#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 452#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 441#L28-3 main_~i~0 := main_~k~0; 451#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 438#L28-2 [2020-07-29 01:28:26,496 INFO L796 eck$LassoCheckResult]: Loop: 438#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 438#L28-2 [2020-07-29 01:28:26,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2020-07-29 01:28:26,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:26,498 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842940575] [2020-07-29 01:28:26,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,523 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,540 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:26,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,541 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2020-07-29 01:28:26,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:26,541 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404618907] [2020-07-29 01:28:26,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,545 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,546 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,547 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2020-07-29 01:28:26,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:26,547 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353686299] [2020-07-29 01:28:26,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:26,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,604 INFO L280 TraceCheckUtils]: 0: Hoare triple {559#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {559#true} is VALID [2020-07-29 01:28:26,604 INFO L280 TraceCheckUtils]: 1: Hoare triple {559#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {559#true} is VALID [2020-07-29 01:28:26,605 INFO L280 TraceCheckUtils]: 2: Hoare triple {559#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {559#true} is VALID [2020-07-29 01:28:26,605 INFO L280 TraceCheckUtils]: 3: Hoare triple {559#true} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {559#true} is VALID [2020-07-29 01:28:26,606 INFO L280 TraceCheckUtils]: 4: Hoare triple {559#true} assume !(main_~k~0 < main_~N~0 - 1); {561#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))} is VALID [2020-07-29 01:28:26,607 INFO L280 TraceCheckUtils]: 5: Hoare triple {561#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))} main_~i~0 := main_~k~0; {562#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:28:26,607 INFO L280 TraceCheckUtils]: 6: Hoare triple {562#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~i~0 1))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {561#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))} is VALID [2020-07-29 01:28:26,608 INFO L280 TraceCheckUtils]: 7: Hoare triple {561#(<= ULTIMATE.start_main_~N~0 (+ ULTIMATE.start_main_~k~0 1))} assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; {560#false} is VALID [2020-07-29 01:28:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:26,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353686299] [2020-07-29 01:28:26,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:26,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:28:26,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444251528] [2020-07-29 01:28:26,628 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:26,628 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:26,628 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:26,628 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:26,628 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:26,628 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,629 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:26,629 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:26,629 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2020-07-29 01:28:26,629 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:26,629 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:26,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,727 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:26,727 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:26,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:26,731 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:28:26,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:26,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:26,875 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:26,877 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:26,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:26,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:26,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:26,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:26,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:26,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:26,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration4_Loop [2020-07-29 01:28:26,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:26,878 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:26,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,978 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:26,978 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:26,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:26,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:26,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,995 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:26,998 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:26,999 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:27,002 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:27,002 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:27,002 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:27,002 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,025 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:27,027 INFO L393 LassoCheck]: Loop: "assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0;" [2020-07-29 01:28:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,069 INFO L280 TraceCheckUtils]: 0: Hoare triple {563#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {563#unseeded} is VALID [2020-07-29 01:28:27,070 INFO L280 TraceCheckUtils]: 1: Hoare triple {563#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,071 INFO L280 TraceCheckUtils]: 2: Hoare triple {563#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,071 INFO L280 TraceCheckUtils]: 3: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,072 INFO L280 TraceCheckUtils]: 4: Hoare triple {563#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {563#unseeded} is VALID [2020-07-29 01:28:27,073 INFO L280 TraceCheckUtils]: 5: Hoare triple {563#unseeded} main_~i~0 := main_~k~0; {563#unseeded} is VALID [2020-07-29 01:28:27,074 INFO L280 TraceCheckUtils]: 6: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,076 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,081 INFO L280 TraceCheckUtils]: 0: Hoare triple {566#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0))} assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; {576#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:27,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:27,092 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:28:27,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,093 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:27,093 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2020-07-29 01:28:27,127 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2020-07-29 01:28:27,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,127 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,127 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,128 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,128 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:27,128 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:27,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2020-07-29 01:28:27,129 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:27,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,130 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,131 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:27,131 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:27,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:27,132 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,132 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 38 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:27,133 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:27,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,155 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:27,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:28:27,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,157 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:27,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,192 INFO L280 TraceCheckUtils]: 0: Hoare triple {563#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {563#unseeded} is VALID [2020-07-29 01:28:27,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {563#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,194 INFO L280 TraceCheckUtils]: 2: Hoare triple {563#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,195 INFO L280 TraceCheckUtils]: 3: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,195 INFO L280 TraceCheckUtils]: 4: Hoare triple {563#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {563#unseeded} is VALID [2020-07-29 01:28:27,196 INFO L280 TraceCheckUtils]: 5: Hoare triple {563#unseeded} main_~i~0 := main_~k~0; {563#unseeded} is VALID [2020-07-29 01:28:27,197 INFO L280 TraceCheckUtils]: 6: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,200 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {566#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0))} assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; {576#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:27,209 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:28:27,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,210 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:27,211 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2020-07-29 01:28:27,238 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2020-07-29 01:28:27,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,239 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:27,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:27,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 38 transitions. [2020-07-29 01:28:27,242 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:28:27,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:27,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:27,244 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:28:27,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,245 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 38 transitions. cyclomatic complexity: 19 [2020-07-29 01:28:27,245 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:27,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:27,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 38 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,272 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2020-07-29 01:28:27,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,273 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:27,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,313 INFO L280 TraceCheckUtils]: 0: Hoare triple {563#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {563#unseeded} is VALID [2020-07-29 01:28:27,314 INFO L280 TraceCheckUtils]: 1: Hoare triple {563#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,314 INFO L280 TraceCheckUtils]: 2: Hoare triple {563#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {563#unseeded} is VALID [2020-07-29 01:28:27,315 INFO L280 TraceCheckUtils]: 3: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,315 INFO L280 TraceCheckUtils]: 4: Hoare triple {563#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {563#unseeded} is VALID [2020-07-29 01:28:27,316 INFO L280 TraceCheckUtils]: 5: Hoare triple {563#unseeded} main_~i~0 := main_~k~0; {563#unseeded} is VALID [2020-07-29 01:28:27,317 INFO L280 TraceCheckUtils]: 6: Hoare triple {563#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {563#unseeded} is VALID [2020-07-29 01:28:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,320 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {566#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0))} assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; {576#(or (and (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~k~0) ULTIMATE.start_main_~N~0)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:27,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:28:27,330 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:28:27,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,331 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:27,331 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2020-07-29 01:28:27,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 36 states and 60 transitions. Complement of second has 5 states. [2020-07-29 01:28:27,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,376 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,376 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:28:27,377 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:27,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 60 transitions. [2020-07-29 01:28:27,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:27,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,379 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 20 states and 31 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:27,379 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2020-07-29 01:28:27,379 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:28:27,380 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2020-07-29 01:28:27,380 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,380 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 36 states and 60 transitions. cyclomatic complexity: 32 [2020-07-29 01:28:27,381 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:28:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:28:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:28:27,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 36 letters. Loop has 36 letters. [2020-07-29 01:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 20 letters. Loop has 20 letters. [2020-07-29 01:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:27,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 1 letters. [2020-07-29 01:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:27,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 20 states and 31 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 36 states and 60 transitions. cyclomatic complexity: 32 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:27,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,394 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:28:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2020-07-29 01:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:28:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2020-07-29 01:28:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:27,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. cyclomatic complexity: 32 [2020-07-29 01:28:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:27,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2020-07-29 01:28:27,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:28:27,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:28:27,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2020-07-29 01:28:27,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:27,399 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2020-07-29 01:28:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2020-07-29 01:28:27,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-29 01:28:27,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:27,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states and 33 transitions. Second operand 20 states. [2020-07-29 01:28:27,402 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states and 33 transitions. Second operand 20 states. [2020-07-29 01:28:27,402 INFO L87 Difference]: Start difference. First operand 22 states and 33 transitions. Second operand 20 states. [2020-07-29 01:28:27,402 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,403 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-29 01:28:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-07-29 01:28:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,404 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:27,404 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states and 33 transitions. [2020-07-29 01:28:27,405 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,406 INFO L93 Difference]: Finished difference Result 22 states and 33 transitions. [2020-07-29 01:28:27,407 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 33 transitions. [2020-07-29 01:28:27,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:27,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:27,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-29 01:28:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2020-07-29 01:28:27,408 INFO L711 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2020-07-29 01:28:27,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:27,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:27,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:27,414 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2020-07-29 01:28:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:27,492 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:28:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:28:27,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:27,509 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:28:27,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:27,511 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 01:28:27,511 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:28:27,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:28:27,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:27,511 INFO L688 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:28:27,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-29 01:28:27,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:27,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 01:28:27,513 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 01:28:27,513 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 19 states. [2020-07-29 01:28:27,514 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,515 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:28:27,515 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,515 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states and 26 transitions. [2020-07-29 01:28:27,515 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states and 26 transitions. [2020-07-29 01:28:27,516 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,517 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2020-07-29 01:28:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:27,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:28:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2020-07-29 01:28:27,518 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:28:27,519 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2020-07-29 01:28:27,519 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:27,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2020-07-29 01:28:27,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:27,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,520 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2020-07-29 01:28:27,520 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:27,520 INFO L794 eck$LassoCheckResult]: Stem: 898#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 892#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 893#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 901#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 902#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 891#L28-3 main_~i~0 := main_~k~0; 905#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 888#L28-2 [2020-07-29 01:28:27,520 INFO L796 eck$LassoCheckResult]: Loop: 888#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 889#L28-3 main_~i~0 := main_~k~0; 895#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 888#L28-2 [2020-07-29 01:28:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2020-07-29 01:28:27,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,521 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331790483] [2020-07-29 01:28:27,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,532 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,534 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2020-07-29 01:28:27,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587875889] [2020-07-29 01:28:27,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,538 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,540 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,542 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2020-07-29 01:28:27,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418679225] [2020-07-29 01:28:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,590 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:27,590 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:27,591 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:27,591 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:27,591 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:27,591 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,591 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:27,591 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:27,592 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2020-07-29 01:28:27,592 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:27,592 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:27,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,749 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:27,750 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,755 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:27,755 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:27,762 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:27,762 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=-8, ULTIMATE.start_main_~i~0=-8, ULTIMATE.start_main_~N~0=-8} Honda state: {ULTIMATE.start_main_~k~0=-8, ULTIMATE.start_main_~i~0=-8, ULTIMATE.start_main_~N~0=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:27,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:27,784 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:27,790 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:27,812 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:27,812 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:27,816 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:27,816 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:27,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:27,838 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:27,863 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:28,001 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:28,003 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:28,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:28,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:28,003 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:28,003 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:28,003 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:28,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:28,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration5_Loop [2020-07-29 01:28:28,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:28,004 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:28,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,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:28:28,172 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:28,172 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:28,177 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:28,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:28,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:28,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:28,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:28,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:28,184 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:28,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:28,208 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:28,208 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:28,208 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:28,209 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:28,210 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:28,214 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:28,255 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:28,257 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:28,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:28,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:28,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:28,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:28,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:28,261 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:28,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:28,286 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:28,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:28,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:28,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:28,288 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:28,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:28,295 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:28,299 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:28,300 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:28,303 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:28,303 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:28,303 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:28,303 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,325 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:28,327 INFO L393 LassoCheck]: Loop: "assume !(main_~k~0 < main_~N~0 - 1);" "main_~i~0 := main_~k~0;" "assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0;" [2020-07-29 01:28:28,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:28,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:28,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:28,378 INFO L280 TraceCheckUtils]: 0: Hoare triple {1000#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1000#unseeded} is VALID [2020-07-29 01:28:28,383 INFO L280 TraceCheckUtils]: 1: Hoare triple {1000#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1000#unseeded} is VALID [2020-07-29 01:28:28,384 INFO L280 TraceCheckUtils]: 2: Hoare triple {1000#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1000#unseeded} is VALID [2020-07-29 01:28:28,385 INFO L280 TraceCheckUtils]: 3: Hoare triple {1000#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1000#unseeded} is VALID [2020-07-29 01:28:28,385 INFO L280 TraceCheckUtils]: 4: Hoare triple {1000#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1000#unseeded} is VALID [2020-07-29 01:28:28,386 INFO L280 TraceCheckUtils]: 5: Hoare triple {1000#unseeded} main_~i~0 := main_~k~0; {1000#unseeded} is VALID [2020-07-29 01:28:28,386 INFO L280 TraceCheckUtils]: 6: Hoare triple {1000#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1000#unseeded} is VALID [2020-07-29 01:28:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:28,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:28,407 INFO L280 TraceCheckUtils]: 0: Hoare triple {1003#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !(main_~k~0 < main_~N~0 - 1); {1003#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:28,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {1003#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} main_~i~0 := main_~k~0; {1003#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:28,409 INFO L280 TraceCheckUtils]: 2: Hoare triple {1003#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1013#(or (and (> oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:28,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:28,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:28,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,420 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:28,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2020-07-29 01:28:28,477 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 5 states. [2020-07-29 01:28:28,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:28,478 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:28,478 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:28,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:28,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:28,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2020-07-29 01:28:28,481 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:28,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,481 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,481 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 26 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:28,482 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:28,482 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:28,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:28,482 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:28,483 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 37 states and 48 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:28,488 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:28,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:28:28,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:28:28,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 37 letters. Loop has 37 letters. [2020-07-29 01:28:28,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:28,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:28,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:28:28,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:28,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:28,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:28,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:28,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:28,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:28,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:28,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:28,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:28,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:28,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:28,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:28,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:28,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 26 transitions. cyclomatic complexity: 11 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:28,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:28,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 37 states and 48 transitions. cyclomatic complexity: 17 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:28,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,525 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:28,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:28,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 01:28:28,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:28,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:28,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2020-07-29 01:28:28,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. cyclomatic complexity: 17 [2020-07-29 01:28:28,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:28,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2020-07-29 01:28:28,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:28:28,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-07-29 01:28:28,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2020-07-29 01:28:28,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:28,529 INFO L688 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2020-07-29 01:28:28,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2020-07-29 01:28:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2020-07-29 01:28:28,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:28,539 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states and 44 transitions. Second operand 25 states. [2020-07-29 01:28:28,540 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states and 44 transitions. Second operand 25 states. [2020-07-29 01:28:28,540 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 25 states. [2020-07-29 01:28:28,541 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:28,545 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-29 01:28:28,547 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 44 transitions. [2020-07-29 01:28:28,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:28,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:28,547 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 33 states and 44 transitions. [2020-07-29 01:28:28,548 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 33 states and 44 transitions. [2020-07-29 01:28:28,548 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:28,550 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-07-29 01:28:28,550 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2020-07-29 01:28:28,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:28,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:28,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:28,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-29 01:28:28,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-07-29 01:28:28,558 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-29 01:28:28,558 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-07-29 01:28:28,558 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:28:28,558 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:28:28,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:28,562 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,562 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 01:28:28,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:28,563 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1090#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1091#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1092#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1106#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1089#L28-3 main_~i~0 := main_~k~0; 1100#L25-2 assume !(main_~j~0 < main_~m~0); 1098#L25-3 main_~i~0 := 1 + main_~i~0; 1099#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1108#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1086#L28-2 [2020-07-29 01:28:28,564 INFO L796 eck$LassoCheckResult]: Loop: 1086#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1087#L28-3 main_~i~0 := main_~k~0; 1109#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1086#L28-2 [2020-07-29 01:28:28,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:28,564 INFO L82 PathProgramCache]: Analyzing trace with hash -538203409, now seen corresponding path program 2 times [2020-07-29 01:28:28,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:28,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338711556] [2020-07-29 01:28:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:28,622 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:28,640 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:28,647 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:28,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:28,652 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 2 times [2020-07-29 01:28:28,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:28,653 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523843114] [2020-07-29 01:28:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:28,661 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:28,665 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:28,668 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:28,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:28,670 INFO L82 PathProgramCache]: Analyzing trace with hash -504812575, now seen corresponding path program 3 times [2020-07-29 01:28:28,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:28,671 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708209757] [2020-07-29 01:28:28,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,762 INFO L280 TraceCheckUtils]: 0: Hoare triple {1244#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1244#true} is VALID [2020-07-29 01:28:28,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {1244#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1244#true} is VALID [2020-07-29 01:28:28,764 INFO L280 TraceCheckUtils]: 2: Hoare triple {1244#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1246#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:28:28,765 INFO L280 TraceCheckUtils]: 3: Hoare triple {1246#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,766 INFO L280 TraceCheckUtils]: 4: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~k~0 < main_~N~0 - 1); {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} main_~i~0 := main_~k~0; {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,767 INFO L280 TraceCheckUtils]: 6: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~j~0 < main_~m~0); {1248#(<= ULTIMATE.start_main_~m~0 1)} is VALID [2020-07-29 01:28:28,767 INFO L280 TraceCheckUtils]: 7: Hoare triple {1248#(<= ULTIMATE.start_main_~m~0 1)} main_~i~0 := 1 + main_~i~0; {1248#(<= ULTIMATE.start_main_~m~0 1)} is VALID [2020-07-29 01:28:28,768 INFO L280 TraceCheckUtils]: 8: Hoare triple {1248#(<= ULTIMATE.start_main_~m~0 1)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1249#(<= ULTIMATE.start_main_~m~0 (+ ULTIMATE.start_main_~j~0 1))} is VALID [2020-07-29 01:28:28,769 INFO L280 TraceCheckUtils]: 9: Hoare triple {1249#(<= ULTIMATE.start_main_~m~0 (+ ULTIMATE.start_main_~j~0 1))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:28:28,769 INFO L280 TraceCheckUtils]: 10: Hoare triple {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} assume !(main_~k~0 < main_~N~0 - 1); {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:28:28,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} main_~i~0 := main_~k~0; {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} is VALID [2020-07-29 01:28:28,771 INFO L280 TraceCheckUtils]: 12: Hoare triple {1250#(<= ULTIMATE.start_main_~m~0 ULTIMATE.start_main_~j~0)} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1245#false} is VALID [2020-07-29 01:28:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:28,772 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708209757] [2020-07-29 01:28:28,773 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190302450] [2020-07-29 01:28:28,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:28,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:28:28,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:28:28,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:28:28,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:28,936 INFO L280 TraceCheckUtils]: 0: Hoare triple {1244#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1244#true} is VALID [2020-07-29 01:28:28,936 INFO L280 TraceCheckUtils]: 1: Hoare triple {1244#true} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1244#true} is VALID [2020-07-29 01:28:28,937 INFO L280 TraceCheckUtils]: 2: Hoare triple {1244#true} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1246#(<= ULTIMATE.start_main_~j~0 0)} is VALID [2020-07-29 01:28:28,938 INFO L280 TraceCheckUtils]: 3: Hoare triple {1246#(<= ULTIMATE.start_main_~j~0 0)} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,939 INFO L280 TraceCheckUtils]: 4: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~k~0 < main_~N~0 - 1); {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} main_~i~0 := main_~k~0; {1247#(<= ULTIMATE.start_main_~j~0 1)} is VALID [2020-07-29 01:28:28,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {1247#(<= ULTIMATE.start_main_~j~0 1)} assume !(main_~j~0 < main_~m~0); {1248#(<= ULTIMATE.start_main_~m~0 1)} is VALID [2020-07-29 01:28:28,942 INFO L280 TraceCheckUtils]: 7: Hoare triple {1248#(<= ULTIMATE.start_main_~m~0 1)} main_~i~0 := 1 + main_~i~0; {1248#(<= ULTIMATE.start_main_~m~0 1)} is VALID [2020-07-29 01:28:28,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {1248#(<= ULTIMATE.start_main_~m~0 1)} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1278#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~m~0 1))} is VALID [2020-07-29 01:28:28,944 INFO L280 TraceCheckUtils]: 9: Hoare triple {1278#(and (<= 0 ULTIMATE.start_main_~j~0) (<= ULTIMATE.start_main_~m~0 1))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:28:28,946 INFO L280 TraceCheckUtils]: 10: Hoare triple {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !(main_~k~0 < main_~N~0 - 1); {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:28:28,947 INFO L280 TraceCheckUtils]: 11: Hoare triple {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} main_~i~0 := main_~k~0; {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:28:28,948 INFO L280 TraceCheckUtils]: 12: Hoare triple {1282#(and (<= ULTIMATE.start_main_~m~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1245#false} is VALID [2020-07-29 01:28:28,949 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:28,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:28,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-29 01:28:28,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302881037] [2020-07-29 01:28:28,975 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:28,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:28,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:28,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:28,976 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:28,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:28,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:28,976 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2020-07-29 01:28:28,976 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:28,977 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:28,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,113 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:29,113 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:29,122 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:29,147 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:29,278 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:29,279 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:29,279 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:29,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:29,280 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:29,280 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:29,280 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,280 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:29,280 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:29,280 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration6_Loop [2020-07-29 01:28:29,280 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:29,280 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:29,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,310 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:29,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:29,428 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:29,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:29,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:29,440 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:29,440 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:29,440 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:29,440 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:29,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:29,441 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,444 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:29,448 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:29,448 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:29,451 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:29,451 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:29,451 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:29,451 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:29,484 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:29,487 INFO L393 LassoCheck]: Loop: "assume !(main_~k~0 < main_~N~0 - 1);" "main_~i~0 := main_~k~0;" "assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0;" [2020-07-29 01:28:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,535 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1289#unseeded} is VALID [2020-07-29 01:28:29,536 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,536 INFO L280 TraceCheckUtils]: 2: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,536 INFO L280 TraceCheckUtils]: 3: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,537 INFO L280 TraceCheckUtils]: 4: Hoare triple {1289#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1289#unseeded} is VALID [2020-07-29 01:28:29,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {1289#unseeded} main_~i~0 := main_~k~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {1289#unseeded} assume !(main_~j~0 < main_~m~0); {1289#unseeded} is VALID [2020-07-29 01:28:29,538 INFO L280 TraceCheckUtils]: 7: Hoare triple {1289#unseeded} main_~i~0 := 1 + main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,538 INFO L280 TraceCheckUtils]: 8: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,539 INFO L280 TraceCheckUtils]: 9: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,551 INFO L280 TraceCheckUtils]: 0: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !(main_~k~0 < main_~N~0 - 1); {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} main_~i~0 := main_~k~0; {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1302#(or (and (> oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:29,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:29,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:29,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,565 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:29,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-07-29 01:28:29,601 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 45 states and 62 transitions. Complement of second has 5 states. [2020-07-29 01:28:29,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:29,602 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:29,603 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2020-07-29 01:28:29,604 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:29,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,605 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:29,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:29,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:29,607 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 62 transitions. cyclomatic complexity: 25 [2020-07-29 01:28:29,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:29,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,621 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:29,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 01:28:29,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,622 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,656 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1289#unseeded} is VALID [2020-07-29 01:28:29,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,658 INFO L280 TraceCheckUtils]: 2: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,659 INFO L280 TraceCheckUtils]: 3: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,659 INFO L280 TraceCheckUtils]: 4: Hoare triple {1289#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1289#unseeded} is VALID [2020-07-29 01:28:29,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {1289#unseeded} main_~i~0 := main_~k~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,660 INFO L280 TraceCheckUtils]: 6: Hoare triple {1289#unseeded} assume !(main_~j~0 < main_~m~0); {1289#unseeded} is VALID [2020-07-29 01:28:29,666 INFO L280 TraceCheckUtils]: 7: Hoare triple {1289#unseeded} main_~i~0 := 1 + main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,666 INFO L280 TraceCheckUtils]: 8: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,667 INFO L280 TraceCheckUtils]: 9: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,676 INFO L280 TraceCheckUtils]: 0: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !(main_~k~0 < main_~N~0 - 1); {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} main_~i~0 := main_~k~0; {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1302#(or (and (> oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:29,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:29,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:29,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:29,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:29,685 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-07-29 01:28:29,710 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 45 states and 62 transitions. Complement of second has 5 states. [2020-07-29 01:28:29,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:29,710 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:29,711 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 62 transitions. [2020-07-29 01:28:29,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:29,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,713 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,713 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:29,713 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:29,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,714 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:29,714 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 45 states and 62 transitions. cyclomatic complexity: 25 [2020-07-29 01:28:29,714 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:29,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 45 letters. Loop has 45 letters. [2020-07-29 01:28:29,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 45 states and 62 transitions. cyclomatic complexity: 25 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,726 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2020-07-29 01:28:29,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,727 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:29,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,758 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1289#unseeded} is VALID [2020-07-29 01:28:29,759 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,759 INFO L280 TraceCheckUtils]: 2: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,760 INFO L280 TraceCheckUtils]: 3: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,763 INFO L280 TraceCheckUtils]: 4: Hoare triple {1289#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1289#unseeded} is VALID [2020-07-29 01:28:29,768 INFO L280 TraceCheckUtils]: 5: Hoare triple {1289#unseeded} main_~i~0 := main_~k~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,769 INFO L280 TraceCheckUtils]: 6: Hoare triple {1289#unseeded} assume !(main_~j~0 < main_~m~0); {1289#unseeded} is VALID [2020-07-29 01:28:29,784 INFO L280 TraceCheckUtils]: 7: Hoare triple {1289#unseeded} main_~i~0 := 1 + main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,785 INFO L280 TraceCheckUtils]: 8: Hoare triple {1289#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1289#unseeded} is VALID [2020-07-29 01:28:29,786 INFO L280 TraceCheckUtils]: 9: Hoare triple {1289#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1289#unseeded} is VALID [2020-07-29 01:28:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:29,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:29,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !(main_~k~0 < main_~N~0 - 1); {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} main_~i~0 := main_~k~0; {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:28:29,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {1292#(>= oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0)))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1302#(or (and (> oldRank0 (+ ULTIMATE.start_main_~m~0 (* (- 1) ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:29,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:29,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:29,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:29,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,808 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:28:29,808 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-07-29 01:28:29,838 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 49 states and 69 transitions. Complement of second has 4 states. [2020-07-29 01:28:29,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:29,838 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:29,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 69 transitions. [2020-07-29 01:28:29,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:28:29,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:29,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:29,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 16 [2020-07-29 01:28:29,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:28:29,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:29,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:29,844 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:29,844 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 49 states and 69 transitions. cyclomatic complexity: 28 [2020-07-29 01:28:29,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 01:28:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:28:29,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 49 letters. Loop has 49 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:29,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:29,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:29,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:29,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:29,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:29,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 16 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:29,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:29,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 49 states and 69 transitions. cyclomatic complexity: 28 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:29,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,859 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:29,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:29,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2020-07-29 01:28:29,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:29,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:29,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 18 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:29,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:29,861 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 69 transitions. cyclomatic complexity: 28 [2020-07-29 01:28:29,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:28:29,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 35 states and 48 transitions. [2020-07-29 01:28:29,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-07-29 01:28:29,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-07-29 01:28:29,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 48 transitions. [2020-07-29 01:28:29,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:29,864 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-29 01:28:29,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 48 transitions. [2020-07-29 01:28:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 24. [2020-07-29 01:28:29,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:29,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states and 48 transitions. Second operand 24 states. [2020-07-29 01:28:29,867 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states and 48 transitions. Second operand 24 states. [2020-07-29 01:28:29,867 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 24 states. [2020-07-29 01:28:29,867 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:29,869 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2020-07-29 01:28:29,869 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2020-07-29 01:28:29,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:29,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:29,870 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 35 states and 48 transitions. [2020-07-29 01:28:29,870 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 35 states and 48 transitions. [2020-07-29 01:28:29,870 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:29,872 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2020-07-29 01:28:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-07-29 01:28:29,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:29,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:29,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:29,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:29,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-29 01:28:29,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 35 transitions. [2020-07-29 01:28:29,873 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 35 transitions. [2020-07-29 01:28:29,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:29,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:28:29,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:28:29,874 INFO L87 Difference]: Start difference. First operand 24 states and 35 transitions. Second operand 9 states. [2020-07-29 01:28:30,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:30,070 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2020-07-29 01:28:30,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:28:30,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:28:30,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:30,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 62 transitions. [2020-07-29 01:28:30,094 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2020-07-29 01:28:30,096 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 38 states and 47 transitions. [2020-07-29 01:28:30,096 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-07-29 01:28:30,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2020-07-29 01:28:30,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 47 transitions. [2020-07-29 01:28:30,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:30,096 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-07-29 01:28:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 47 transitions. [2020-07-29 01:28:30,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2020-07-29 01:28:30,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:30,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states and 47 transitions. Second operand 30 states. [2020-07-29 01:28:30,099 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states and 47 transitions. Second operand 30 states. [2020-07-29 01:28:30,099 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 30 states. [2020-07-29 01:28:30,099 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,101 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-29 01:28:30,101 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2020-07-29 01:28:30,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,102 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 38 states and 47 transitions. [2020-07-29 01:28:30,102 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 38 states and 47 transitions. [2020-07-29 01:28:30,102 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:30,103 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2020-07-29 01:28:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2020-07-29 01:28:30,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:30,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:30,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:30,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-29 01:28:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2020-07-29 01:28:30,105 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 01:28:30,105 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2020-07-29 01:28:30,105 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:28:30,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2020-07-29 01:28:30,106 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2020-07-29 01:28:30,106 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:30,106 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:30,106 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-07-29 01:28:30,106 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2020-07-29 01:28:30,107 INFO L794 eck$LassoCheckResult]: Stem: 1802#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1800#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1801#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1815#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1811#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1808#L28-3 main_~i~0 := main_~k~0; 1806#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1807#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1819#L28-3 [2020-07-29 01:28:30,107 INFO L796 eck$LassoCheckResult]: Loop: 1819#L28-3 main_~i~0 := main_~k~0; 1818#L25-2 assume !(main_~j~0 < main_~m~0); 1817#L25-3 main_~i~0 := 1 + main_~i~0; 1816#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1813#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1810#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1808#L28-3 main_~i~0 := main_~k~0; 1806#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1807#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1819#L28-3 [2020-07-29 01:28:30,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,107 INFO L82 PathProgramCache]: Analyzing trace with hash -416201990, now seen corresponding path program 5 times [2020-07-29 01:28:30,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211665911] [2020-07-29 01:28:30,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,113 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,118 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,120 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2109857963, now seen corresponding path program 1 times [2020-07-29 01:28:30,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878203823] [2020-07-29 01:28:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,125 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,131 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1471552046, now seen corresponding path program 4 times [2020-07-29 01:28:30,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:30,134 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670558773] [2020-07-29 01:28:30,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,143 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:30,150 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:30,153 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:30,242 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:30,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:30,243 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:30,243 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:30,243 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:30,243 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,243 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:30,243 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:30,244 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2020-07-29 01:28:30,244 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:30,244 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:30,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:30,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:30,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:30,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:30,415 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:30,415 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:30,421 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:30,421 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,446 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:30,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:30,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=2, ULTIMATE.start_main_~m~0=2} Honda state: {ULTIMATE.start_main_~j~0=2, ULTIMATE.start_main_~m~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:30,471 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:30,474 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:30,474 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_13=0} Honda state: {v_rep~unnamed0~0~false_13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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:28:30,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:30,498 INFO L160 nArgumentSynthesizer]: Using integer mode. 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:28:30,527 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:30,527 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:42,567 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2020-07-29 01:28:42,570 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:42,570 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:42,570 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:42,570 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:42,570 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:42,570 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,571 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:42,571 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:42,571 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration7_Loop [2020-07-29 01:28:42,571 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:42,571 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:42,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:42,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:42,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:42,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:42,740 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:42,740 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:42,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,745 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,747 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:42,747 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:42,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:42,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:42,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:42,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:42,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:42,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:42,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:42,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:42,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:42,809 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:42,813 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:42,813 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,815 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:42,815 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:42,815 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:42,815 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] [2020-07-29 01:28:42,837 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:42,840 INFO L393 LassoCheck]: Loop: "main_~i~0 := main_~k~0;" "assume !(main_~j~0 < main_~m~0);" "main_~i~0 := 1 + main_~i~0;" "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" "assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0;" "assume !(main_~k~0 < main_~N~0 - 1);" "main_~i~0 := main_~k~0;" "assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0;" "assume !(main_~k~0 < main_~N~0 - 1);" [2020-07-29 01:28:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:42,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {1989#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {1989#unseeded} is VALID [2020-07-29 01:28:42,879 INFO L280 TraceCheckUtils]: 1: Hoare triple {1989#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {1989#unseeded} is VALID [2020-07-29 01:28:42,881 INFO L280 TraceCheckUtils]: 2: Hoare triple {1989#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {1989#unseeded} is VALID [2020-07-29 01:28:42,882 INFO L280 TraceCheckUtils]: 3: Hoare triple {1989#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1989#unseeded} is VALID [2020-07-29 01:28:42,882 INFO L280 TraceCheckUtils]: 4: Hoare triple {1989#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1989#unseeded} is VALID [2020-07-29 01:28:42,883 INFO L280 TraceCheckUtils]: 5: Hoare triple {1989#unseeded} main_~i~0 := main_~k~0; {1989#unseeded} is VALID [2020-07-29 01:28:42,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {1989#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {1989#unseeded} is VALID [2020-07-29 01:28:42,884 INFO L280 TraceCheckUtils]: 7: Hoare triple {1989#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {1989#unseeded} is VALID [2020-07-29 01:28:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:28:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:42,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:43,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {1992#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~k~0)))} main_~i~0 := main_~k~0; {2028#(<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:43,158 INFO L280 TraceCheckUtils]: 1: Hoare triple {2028#(<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !(main_~j~0 < main_~m~0); {2028#(<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:43,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {2028#(<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0))} main_~i~0 := 1 + main_~i~0; {2035#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:43,160 INFO L280 TraceCheckUtils]: 3: Hoare triple {2035#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2039#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:43,161 INFO L280 TraceCheckUtils]: 4: Hoare triple {2039#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} is VALID [2020-07-29 01:28:43,162 INFO L280 TraceCheckUtils]: 5: Hoare triple {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} assume !(main_~k~0 < main_~N~0 - 1); {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} is VALID [2020-07-29 01:28:43,162 INFO L280 TraceCheckUtils]: 6: Hoare triple {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} main_~i~0 := main_~k~0; {2050#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= 2 oldRank0))} is VALID [2020-07-29 01:28:43,163 INFO L280 TraceCheckUtils]: 7: Hoare triple {2050#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0)) (<= 2 oldRank0))} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} is VALID [2020-07-29 01:28:43,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {2043#(and (<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~k~0)) (<= 2 oldRank0))} assume !(main_~k~0 < main_~N~0 - 1); {2002#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~k~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:28:43,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:28:43,178 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:28:43,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,179 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2020-07-29 01:28:43,179 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14 Second operand 7 states. [2020-07-29 01:28:43,430 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 14. Second operand 7 states. Result 57 states and 72 transitions. Complement of second has 12 states. [2020-07-29 01:28:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:43,430 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:43,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. cyclomatic complexity: 14 [2020-07-29 01:28:43,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:43,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:43,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 57 states and 72 transitions. [2020-07-29 01:28:43,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:43,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,433 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 30 states and 39 transitions. cyclomatic complexity: 14 [2020-07-29 01:28:43,434 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2020-07-29 01:28:43,434 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:28:43,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:28:43,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:43,442 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 57 states and 72 transitions. cyclomatic complexity: 23 [2020-07-29 01:28:43,442 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:43,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:28:43,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:28:43,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 57 letters. Loop has 57 letters. [2020-07-29 01:28:43,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:43,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 30 letters. Loop has 30 letters. [2020-07-29 01:28:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:43,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:43,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:43,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:43,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 6 letters. [2020-07-29 01:28:43,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:43,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:43,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 6 letters. [2020-07-29 01:28:43,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:28:43,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:28:43,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 6 letters. [2020-07-29 01:28:43,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:28:43,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:28:43,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 6 letters. [2020-07-29 01:28:43,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:28:43,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:28:43,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 15 letters. Loop has 6 letters. [2020-07-29 01:28:43,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:43,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:43,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 6 letters. [2020-07-29 01:28:43,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:28:43,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:28:43,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 9 letters. [2020-07-29 01:28:43,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:28:43,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:28:43,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 12 letters. Loop has 9 letters. [2020-07-29 01:28:43,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:28:43,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:28:43,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 11 letters. Loop has 9 letters. [2020-07-29 01:28:43,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:28:43,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:28:43,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 10 letters. Loop has 9 letters. [2020-07-29 01:28:43,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:43,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:43,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:28:43,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:43,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 15 letters. Loop has 3 letters. [2020-07-29 01:28:43,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 13 letters. Loop has 3 letters. [2020-07-29 01:28:43,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 30 states and 39 transitions. cyclomatic complexity: 14 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 57 states and 72 transitions. cyclomatic complexity: 23 Stem has 14 letters. Loop has 3 letters. [2020-07-29 01:28:43,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,490 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:43,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2020-07-29 01:28:43,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 8 letters. Loop has 9 letters. [2020-07-29 01:28:43,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 17 letters. Loop has 9 letters. [2020-07-29 01:28:43,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 8 letters. Loop has 18 letters. [2020-07-29 01:28:43,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:43,492 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 72 transitions. cyclomatic complexity: 23 [2020-07-29 01:28:43,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:43,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 50 states and 63 transitions. [2020-07-29 01:28:43,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-29 01:28:43,496 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-07-29 01:28:43,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 63 transitions. [2020-07-29 01:28:43,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:43,496 INFO L688 BuchiCegarLoop]: Abstraction has 50 states and 63 transitions. [2020-07-29 01:28:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 63 transitions. [2020-07-29 01:28:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2020-07-29 01:28:43,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:43,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states and 63 transitions. Second operand 35 states. [2020-07-29 01:28:43,500 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states and 63 transitions. Second operand 35 states. [2020-07-29 01:28:43,500 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 35 states. [2020-07-29 01:28:43,500 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:43,505 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2020-07-29 01:28:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-29 01:28:43,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:43,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:43,505 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 50 states and 63 transitions. [2020-07-29 01:28:43,506 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 50 states and 63 transitions. [2020-07-29 01:28:43,506 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:43,508 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2020-07-29 01:28:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2020-07-29 01:28:43,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:43,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:43,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:43,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:43,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-29 01:28:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2020-07-29 01:28:43,510 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-29 01:28:43,510 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 48 transitions. [2020-07-29 01:28:43,510 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:28:43,510 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. [2020-07-29 01:28:43,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:43,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:43,511 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:43,511 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1] [2020-07-29 01:28:43,511 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:43,511 INFO L794 eck$LassoCheckResult]: Stem: 2147#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 2141#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 2142#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 2154#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 2136#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 2137#L28-3 main_~i~0 := main_~k~0; 2164#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 2157#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 2152#L28-3 main_~i~0 := main_~k~0; 2144#L25-2 [2020-07-29 01:28:43,511 INFO L796 eck$LassoCheckResult]: Loop: 2144#L25-2 assume !(main_~j~0 < main_~m~0); 2148#L25-3 main_~i~0 := 1 + main_~i~0; 2143#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 2144#L25-2 [2020-07-29 01:28:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:43,512 INFO L82 PathProgramCache]: Analyzing trace with hash -17359767, now seen corresponding path program 6 times [2020-07-29 01:28:43,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,512 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985714425] [2020-07-29 01:28:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,517 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,522 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,527 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:43,528 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 3 times [2020-07-29 01:28:43,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,528 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022331726] [2020-07-29 01:28:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,534 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,535 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,541 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:43,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1768722735, now seen corresponding path program 5 times [2020-07-29 01:28:43,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,542 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678734483] [2020-07-29 01:28:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,554 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,559 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,582 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:43,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:43,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:43,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:43,582 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:43,583 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:43,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:43,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2020-07-29 01:28:43,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:43,583 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:43,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,715 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:43,715 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:43,723 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:43,723 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,746 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:43,750 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:43,750 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,778 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:43,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:44,099 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:44,101 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:44,101 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:44,101 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:44,101 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:44,101 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:44,102 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,102 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:44,102 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:44,102 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop-1.c_Iteration8_Loop [2020-07-29 01:28:44,102 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:44,102 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:44,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,234 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:44,234 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,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:28:44,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:44,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:44,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:44,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:44,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:44,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:44,246 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:44,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:44,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:44,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:44,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:44,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:44,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:44,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:44,275 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:44,278 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:44,278 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,282 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:44,282 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:44,282 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:44,282 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:28:44,304 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:44,306 INFO L393 LassoCheck]: Loop: "assume !(main_~j~0 < main_~m~0);" "main_~i~0 := 1 + main_~i~0;" "assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0;" [2020-07-29 01:28:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {2386#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {2386#unseeded} is VALID [2020-07-29 01:28:44,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {2386#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,340 INFO L280 TraceCheckUtils]: 2: Hoare triple {2386#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,344 INFO L280 TraceCheckUtils]: 3: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,349 INFO L280 TraceCheckUtils]: 7: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,354 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,394 INFO L280 TraceCheckUtils]: 0: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !(main_~j~0 < main_~m~0); {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 01:28:44,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_~i~0 := 1 + main_~i~0; {2431#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:44,396 INFO L280 TraceCheckUtils]: 2: Hoare triple {2431#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2399#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:44,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:44,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:44,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:44,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,403 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:44,403 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-07-29 01:28:44,448 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 59 states and 76 transitions. Complement of second has 7 states. [2020-07-29 01:28:44,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:44,448 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:44,455 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,455 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,455 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 76 transitions. [2020-07-29 01:28:44,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,456 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,459 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,459 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:44,459 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:44,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,460 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:44,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 59 states and 76 transitions. cyclomatic complexity: 24 [2020-07-29 01:28:44,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,476 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:28:44,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,477 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,507 INFO L280 TraceCheckUtils]: 0: Hoare triple {2386#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {2386#unseeded} is VALID [2020-07-29 01:28:44,507 INFO L280 TraceCheckUtils]: 1: Hoare triple {2386#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,508 INFO L280 TraceCheckUtils]: 2: Hoare triple {2386#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,509 INFO L280 TraceCheckUtils]: 4: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,510 INFO L280 TraceCheckUtils]: 5: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,511 INFO L280 TraceCheckUtils]: 6: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,511 INFO L280 TraceCheckUtils]: 7: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,512 INFO L280 TraceCheckUtils]: 8: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,516 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !(main_~j~0 < main_~m~0); {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 01:28:44,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_~i~0 := 1 + main_~i~0; {2535#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:44,568 INFO L280 TraceCheckUtils]: 2: Hoare triple {2535#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2399#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:44,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:44,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:44,576 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:44,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,577 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:44,577 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-07-29 01:28:44,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 59 states and 76 transitions. Complement of second has 7 states. [2020-07-29 01:28:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:44,613 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,613 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:44,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states and 76 transitions. [2020-07-29 01:28:44,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,615 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,615 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:44,615 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:44,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,616 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:44,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 59 states and 76 transitions. cyclomatic complexity: 24 [2020-07-29 01:28:44,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 59 letters. Loop has 59 letters. [2020-07-29 01:28:44,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 59 states and 76 transitions. cyclomatic complexity: 24 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,626 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2020-07-29 01:28:44,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,628 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:44,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {2386#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; {2386#unseeded} is VALID [2020-07-29 01:28:44,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {2386#unseeded} assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,660 INFO L280 TraceCheckUtils]: 2: Hoare triple {2386#unseeded} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2386#unseeded} is VALID [2020-07-29 01:28:44,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,661 INFO L280 TraceCheckUtils]: 4: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,662 INFO L280 TraceCheckUtils]: 5: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,662 INFO L280 TraceCheckUtils]: 6: Hoare triple {2386#unseeded} assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,663 INFO L280 TraceCheckUtils]: 7: Hoare triple {2386#unseeded} assume !(main_~k~0 < main_~N~0 - 1); {2386#unseeded} is VALID [2020-07-29 01:28:44,663 INFO L280 TraceCheckUtils]: 8: Hoare triple {2386#unseeded} main_~i~0 := main_~k~0; {2386#unseeded} is VALID [2020-07-29 01:28:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,667 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !(main_~j~0 < main_~m~0); {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} is VALID [2020-07-29 01:28:44,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {2389#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} main_~i~0 := 1 + main_~i~0; {2639#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} is VALID [2020-07-29 01:28:44,712 INFO L280 TraceCheckUtils]: 2: Hoare triple {2639#(<= (+ ULTIMATE.start_main_~n~0 1) (+ oldRank0 ULTIMATE.start_main_~i~0))} assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; {2399#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:44,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:44,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:44,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,721 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:44,721 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20 Second operand 4 states. [2020-07-29 01:28:44,767 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 48 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 54 states and 73 transitions. Complement of second has 6 states. [2020-07-29 01:28:44,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:44,768 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:44,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. [2020-07-29 01:28:44,773 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:44,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:44,773 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 48 transitions. cyclomatic complexity: 20 [2020-07-29 01:28:44,774 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:44,774 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:44,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:44,775 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:44,775 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 54 states and 73 transitions. cyclomatic complexity: 26 [2020-07-29 01:28:44,775 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 73 transitions. cyclomatic complexity: 26 [2020-07-29 01:28:44,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:44,775 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:28:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:28:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 54 letters. Loop has 54 letters. [2020-07-29 01:28:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:28:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:44,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 10 letters. Loop has 3 letters. [2020-07-29 01:28:44,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 11 letters. Loop has 3 letters. [2020-07-29 01:28:44,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 48 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 54 states and 73 transitions. cyclomatic complexity: 26 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:44,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,782 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2020-07-29 01:28:44,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 3 letters. [2020-07-29 01:28:44,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 12 letters. Loop has 3 letters. [2020-07-29 01:28:44,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 6 letters. [2020-07-29 01:28:44,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,783 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 73 transitions. cyclomatic complexity: 26 [2020-07-29 01:28:44,784 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:44,785 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 0 states and 0 transitions. [2020-07-29 01:28:44,785 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:44,785 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:44,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:44,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:44,785 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:44,785 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:44,785 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:44,785 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:28:44,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:44,786 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:44,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:44,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:44 BoogieIcfgContainer [2020-07-29 01:28:44,794 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:44,794 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:44,794 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:44,794 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:44,795 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:22" (3/4) ... [2020-07-29 01:28:44,798 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:44,798 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:44,801 INFO L168 Benchmark]: Toolchain (without parser) took 23352.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.1 MB). Free memory was 954.8 MB in the beginning and 1.1 GB in the end (delta: -162.8 MB). Peak memory consumption was 153.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,801 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:44,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,802 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,803 INFO L168 Benchmark]: Boogie Preprocessor took 24.52 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,803 INFO L168 Benchmark]: RCFGBuilder took 372.39 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,804 INFO L168 Benchmark]: BuchiAutomizer took 22541.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.0 MB). Peak memory consumption was 169.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:44,804 INFO L168 Benchmark]: Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:44,806 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 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.66 ms. Allocated memory is still 1.0 GB. Free memory was 954.8 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -189.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.52 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 372.39 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 22541.06 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 179.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -10.0 MB). Peak memory consumption was 169.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.36 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (2 trivial, 5 deterministic, 3 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + n and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function n + -1 * k and consists of 7 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. One nondeterministic module has affine ranking function n + -1 * i and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 22.4s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 19.0s. Construction of modules took 0.2s. Büchi inclusion checks took 2.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 47 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 7. Nontrivial modules had stage [5, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/5 HoareTripleCheckerStatistics: 179 SDtfs, 222 SDslu, 78 SDs, 0 SdLazy, 156 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax169 hnf96 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf92 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 13.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...