./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/java_Nested.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-restricted-15/java_Nested.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 0baccb6c9a05802d446420fb16b8e65dc76eab5e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:31:40,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:31:40,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:31:40,632 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:31:40,632 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:31:40,633 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:31:40,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:31:40,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:31:40,639 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:31:40,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:31:40,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:31:40,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:31:40,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:31:40,643 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:31:40,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:31:40,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:31:40,647 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:31:40,648 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:31:40,650 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:31:40,652 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:31:40,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:31:40,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:31:40,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:31:40,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:31:40,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:31:40,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:31:40,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:31:40,662 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:31:40,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:31:40,663 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:31:40,663 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:31:40,664 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:31:40,665 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:31:40,666 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:31:40,667 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:31:40,667 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:31:40,668 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:31:40,668 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:31:40,669 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:31:40,670 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:31:40,670 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:31:40,671 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:31:40,704 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:31:40,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:31:40,709 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:31:40,709 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:31:40,709 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:31:40,712 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:31:40,713 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:31:40,713 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:31:40,713 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:31:40,714 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:31:40,714 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:31:40,714 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:31:40,714 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:31:40,715 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:31:40,715 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:31:40,715 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:31:40,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:31:40,718 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:31:40,718 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:31:40,718 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:31:40,718 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:31:40,719 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:31:40,719 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:31:40,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:31:40,720 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:31:40,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:31:40,721 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:31:40,721 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:31:40,722 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:31:40,723 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:31:40,724 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 -> 0baccb6c9a05802d446420fb16b8e65dc76eab5e [2020-07-29 01:31:41,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:31:41,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:31:41,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:31:41,068 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:31:41,068 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:31:41,069 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/java_Nested.c [2020-07-29 01:31:41,139 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3721b4e/786b5ab6262d4017bb28d7be2eec7568/FLAG9ce681eb7 [2020-07-29 01:31:41,607 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:31:41,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/java_Nested.c [2020-07-29 01:31:41,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3721b4e/786b5ab6262d4017bb28d7be2eec7568/FLAG9ce681eb7 [2020-07-29 01:31:42,043 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d3721b4e/786b5ab6262d4017bb28d7be2eec7568 [2020-07-29 01:31:42,047 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:31:42,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:31:42,053 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:42,053 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:31:42,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:31:42,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6868c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42, skipping insertion in model container [2020-07-29 01:31:42,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:31:42,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:31:42,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:42,332 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:31:42,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:31:42,374 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:31:42,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42 WrapperNode [2020-07-29 01:31:42,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:31:42,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:42,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:31:42,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:31:42,383 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:31:42" (1/1) ... [2020-07-29 01:31:42,388 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:31:42" (1/1) ... [2020-07-29 01:31:42,404 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:31:42,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:31:42,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:31:42,405 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:31:42,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,470 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,470 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (1/1) ... [2020-07-29 01:31:42,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:31:42,483 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:31:42,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:31:42,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:31:42,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (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:31:42,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:31:42,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:31:42,738 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:31:42,738 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:31:42,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:42 BoogieIcfgContainer [2020-07-29 01:31:42,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:31:42,742 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:31:42,742 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:31:42,746 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:31:42,747 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:42,747 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:31:42" (1/3) ... [2020-07-29 01:31:42,748 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c57c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:42, skipping insertion in model container [2020-07-29 01:31:42,748 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:42,749 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:31:42" (2/3) ... [2020-07-29 01:31:42,749 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7c57c300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:31:42, skipping insertion in model container [2020-07-29 01:31:42,749 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:31:42,750 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:42" (3/3) ... [2020-07-29 01:31:42,751 INFO L371 chiAutomizerObserver]: Analyzing ICFG java_Nested.c [2020-07-29 01:31:42,804 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:31:42,804 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:31:42,804 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:31:42,805 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:31:42,805 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:31:42,805 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:31:42,805 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:31:42,806 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:31:42,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:42,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:42,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:42,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:42,869 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:42,869 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:42,869 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:31:42,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:31:42,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:31:42,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:42,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:42,873 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:42,874 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:31:42,883 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 7#L10-2true [2020-07-29 01:31:42,884 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 10);main_~j~0 := 3; 3#L12-2true assume !(main_~j~0 < 12); 10#L12-3true main_~i~0 := 1 + main_~i~0; 7#L10-2true [2020-07-29 01:31:42,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:31:42,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:42,903 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249182101] [2020-07-29 01:31:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:42,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:42,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:42,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:43,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,012 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:31:43,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279120591] [2020-07-29 01:31:43,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,087 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {16#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,088 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#(<= ULTIMATE.start_main_~j~0 3)} assume !(main_~j~0 < 12); {15#false} is VALID [2020-07-29 01:31:43,089 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} main_~i~0 := 1 + main_~i~0; {15#false} is VALID [2020-07-29 01:31:43,091 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:31:43,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279120591] [2020-07-29 01:31:43,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:31:43,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:31:43,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496746182] [2020-07-29 01:31:43,099 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:43,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:43,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:31:43,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:31:43,117 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-07-29 01:31:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,170 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:31:43,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:31:43,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:43,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:43,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:31:43,184 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:43,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2020-07-29 01:31:43,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:31:43,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:31:43,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-07-29 01:31:43,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:43,192 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:43,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-07-29 01:31:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-29 01:31:43,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:43,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:43,215 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:43,216 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:31:43,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,218 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:31:43,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:43,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,220 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:31:43,220 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:31:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,221 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:31:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:43,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:43,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:31:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-07-29 01:31:43,224 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:43,225 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:31:43,225 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:31:43,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:31:43,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:31:43,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:43,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:43,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:43,227 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:31:43,227 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 29#L10-2 [2020-07-29 01:31:43,227 INFO L796 eck$LassoCheckResult]: Loop: 29#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 26#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 27#L12-2 assume !(main_~j~0 < 12); 30#L12-3 main_~i~0 := 1 + main_~i~0; 29#L10-2 [2020-07-29 01:31:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,228 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:31:43,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,228 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136981021] [2020-07-29 01:31:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,233 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,237 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:43,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2020-07-29 01:31:43,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,239 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887206941] [2020-07-29 01:31:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,297 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {48#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,298 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {49#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:43,300 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= ULTIMATE.start_main_~j~0 4)} assume !(main_~j~0 < 12); {47#false} is VALID [2020-07-29 01:31:43,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#false} main_~i~0 := 1 + main_~i~0; {47#false} is VALID [2020-07-29 01:31:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:43,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887206941] [2020-07-29 01:31:43,301 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159719482] [2020-07-29 01:31:43,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:31:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:43,489 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {48#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {49#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:43,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {49#(<= ULTIMATE.start_main_~j~0 4)} assume !(main_~j~0 < 12); {47#false} is VALID [2020-07-29 01:31:43,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {47#false} main_~i~0 := 1 + main_~i~0; {47#false} is VALID [2020-07-29 01:31:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:43,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:43,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:31:43,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138657817] [2020-07-29 01:31:43,495 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:43,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:43,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:31:43,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:31:43,496 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 01:31:43,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,538 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:31:43,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:31:43,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:31:43,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:43,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:31:43,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:31:43,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:31:43,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:31:43,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:43,553 INFO L688 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:31:43,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2020-07-29 01:31:43,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:43,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:31:43,555 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:31:43,555 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 6 states. [2020-07-29 01:31:43,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,556 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:31:43,556 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,557 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 6 states and 7 transitions. [2020-07-29 01:31:43,557 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 6 states and 7 transitions. [2020-07-29 01:31:43,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,559 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2020-07-29 01:31:43,559 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:43,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:31:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:31:43,561 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:31:43,561 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:31:43,562 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:31:43,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:31:43,562 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:31:43,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:43,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:43,563 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:43,563 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2020-07-29 01:31:43,564 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 68#L10-2 [2020-07-29 01:31:43,564 INFO L796 eck$LassoCheckResult]: Loop: 68#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 65#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 66#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 70#L12-2 assume !(main_~j~0 < 12); 69#L12-3 main_~i~0 := 1 + main_~i~0; 68#L10-2 [2020-07-29 01:31:43,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2020-07-29 01:31:43,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928391013] [2020-07-29 01:31:43,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:43,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,574 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2020-07-29 01:31:43,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,575 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231411887] [2020-07-29 01:31:43,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {90#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,634 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {91#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:43,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {92#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:43,636 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#(<= ULTIMATE.start_main_~j~0 5)} assume !(main_~j~0 < 12); {89#false} is VALID [2020-07-29 01:31:43,637 INFO L280 TraceCheckUtils]: 4: Hoare triple {89#false} main_~i~0 := 1 + main_~i~0; {89#false} is VALID [2020-07-29 01:31:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:43,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231411887] [2020-07-29 01:31:43,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355585949] [2020-07-29 01:31:43,638 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:43,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:31:43,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:43,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:43,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:43,779 INFO L280 TraceCheckUtils]: 0: Hoare triple {88#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {90#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,780 INFO L280 TraceCheckUtils]: 1: Hoare triple {90#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {91#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:43,781 INFO L280 TraceCheckUtils]: 2: Hoare triple {91#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {92#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:43,782 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#(<= ULTIMATE.start_main_~j~0 5)} assume !(main_~j~0 < 12); {89#false} is VALID [2020-07-29 01:31:43,783 INFO L280 TraceCheckUtils]: 4: Hoare triple {89#false} main_~i~0 := 1 + main_~i~0; {89#false} is VALID [2020-07-29 01:31:43,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:43,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:43,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2020-07-29 01:31:43,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970393633] [2020-07-29 01:31:43,785 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:43,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:43,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 01:31:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:31:43,786 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2020-07-29 01:31:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,821 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:31:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-29 01:31:43,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 01:31:43,830 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:31:43,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:43,833 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:31:43,833 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:31:43,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:31:43,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:43,834 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:31:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:31:43,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:43,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:31:43,836 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:31:43,836 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2020-07-29 01:31:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,838 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:31:43,838 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,839 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:31:43,839 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 8 transitions. [2020-07-29 01:31:43,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:43,840 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-29 01:31:43,840 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:43,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:43,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:43,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:31:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-29 01:31:43,843 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:31:43,843 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-29 01:31:43,843 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:31:43,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2020-07-29 01:31:43,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-07-29 01:31:43,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:43,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:43,845 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:43,845 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2020-07-29 01:31:43,845 INFO L794 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 115#L10-2 [2020-07-29 01:31:43,846 INFO L796 eck$LassoCheckResult]: Loop: 115#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 112#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 113#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 118#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 117#L12-2 assume !(main_~j~0 < 12); 116#L12-3 main_~i~0 := 1 + main_~i~0; 115#L10-2 [2020-07-29 01:31:43,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,846 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2020-07-29 01:31:43,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452166145] [2020-07-29 01:31:43,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:43,853 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:43,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:43,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:43,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2020-07-29 01:31:43,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:43,856 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162945817] [2020-07-29 01:31:43,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:43,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,938 INFO L280 TraceCheckUtils]: 0: Hoare triple {138#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {140#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:43,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {141#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:43,941 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {142#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:43,943 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {143#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:43,944 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(<= ULTIMATE.start_main_~j~0 6)} assume !(main_~j~0 < 12); {139#false} is VALID [2020-07-29 01:31:43,944 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#false} main_~i~0 := 1 + main_~i~0; {139#false} is VALID [2020-07-29 01:31:43,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:43,945 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162945817] [2020-07-29 01:31:43,946 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869379753] [2020-07-29 01:31:43,946 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:31:43,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:31:43,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:43,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:43,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:44,125 INFO L280 TraceCheckUtils]: 0: Hoare triple {138#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {140#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:44,127 INFO L280 TraceCheckUtils]: 1: Hoare triple {140#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {141#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:44,129 INFO L280 TraceCheckUtils]: 2: Hoare triple {141#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {142#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:44,130 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {143#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:44,132 INFO L280 TraceCheckUtils]: 4: Hoare triple {143#(<= ULTIMATE.start_main_~j~0 6)} assume !(main_~j~0 < 12); {139#false} is VALID [2020-07-29 01:31:44,132 INFO L280 TraceCheckUtils]: 5: Hoare triple {139#false} main_~i~0 := 1 + main_~i~0; {139#false} is VALID [2020-07-29 01:31:44,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:44,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:44,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-29 01:31:44,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102647677] [2020-07-29 01:31:44,134 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:44,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-29 01:31:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-29 01:31:44,135 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2020-07-29 01:31:44,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,194 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:31:44,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 01:31:44,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-29 01:31:44,204 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:44,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:44,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:31:44,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:31:44,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:31:44,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:44,207 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:31:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:31:44,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:44,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:31:44,210 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:31:44,210 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 8 states. [2020-07-29 01:31:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,215 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:31:44,215 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:44,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:44,216 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:31:44,216 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 9 transitions. [2020-07-29 01:31:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,220 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:31:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:44,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:44,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:44,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:44,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:31:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-29 01:31:44,224 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:31:44,224 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:31:44,229 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:31:44,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:31:44,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 01:31:44,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:44,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:44,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:44,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2020-07-29 01:31:44,232 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 170#L10-2 [2020-07-29 01:31:44,232 INFO L796 eck$LassoCheckResult]: Loop: 170#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 167#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 168#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 174#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 173#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 172#L12-2 assume !(main_~j~0 < 12); 171#L12-3 main_~i~0 := 1 + main_~i~0; 170#L10-2 [2020-07-29 01:31:44,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2020-07-29 01:31:44,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:44,234 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708446187] [2020-07-29 01:31:44,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:44,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:44,245 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:44,250 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:44,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:44,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:44,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2020-07-29 01:31:44,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:44,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294271312] [2020-07-29 01:31:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:44,336 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {198#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:44,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {199#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:44,339 INFO L280 TraceCheckUtils]: 2: Hoare triple {199#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {200#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:44,340 INFO L280 TraceCheckUtils]: 3: Hoare triple {200#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {201#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:44,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {201#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {202#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:44,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {202#(<= ULTIMATE.start_main_~j~0 7)} assume !(main_~j~0 < 12); {197#false} is VALID [2020-07-29 01:31:44,343 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#false} main_~i~0 := 1 + main_~i~0; {197#false} is VALID [2020-07-29 01:31:44,344 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:44,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294271312] [2020-07-29 01:31:44,344 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173206662] [2020-07-29 01:31:44,345 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:31:44,376 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-29 01:31:44,377 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:44,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:44,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:44,531 INFO L280 TraceCheckUtils]: 0: Hoare triple {196#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {198#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:44,532 INFO L280 TraceCheckUtils]: 1: Hoare triple {198#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {199#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:44,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {199#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {200#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:44,535 INFO L280 TraceCheckUtils]: 3: Hoare triple {200#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {201#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:44,536 INFO L280 TraceCheckUtils]: 4: Hoare triple {201#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {202#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:44,537 INFO L280 TraceCheckUtils]: 5: Hoare triple {202#(<= ULTIMATE.start_main_~j~0 7)} assume !(main_~j~0 < 12); {197#false} is VALID [2020-07-29 01:31:44,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {197#false} main_~i~0 := 1 + main_~i~0; {197#false} is VALID [2020-07-29 01:31:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:44,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:44,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2020-07-29 01:31:44,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374314770] [2020-07-29 01:31:44,539 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:44,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:44,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-29 01:31:44,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-29 01:31:44,541 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2020-07-29 01:31:44,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,585 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:31:44,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-29 01:31:44,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-29 01:31:44,601 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:44,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:31:44,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:31:44,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:31:44,604 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:31:44,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:44,604 INFO L688 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:31:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-29 01:31:44,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:44,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:31:44,606 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:31:44,606 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 9 states. [2020-07-29 01:31:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,607 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:31:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:44,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:44,609 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states and 10 transitions. [2020-07-29 01:31:44,609 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states and 10 transitions. [2020-07-29 01:31:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,610 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:31:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:44,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:44,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:44,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-29 01:31:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2020-07-29 01:31:44,613 INFO L711 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:31:44,613 INFO L591 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2020-07-29 01:31:44,613 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:31:44,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2020-07-29 01:31:44,614 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-07-29 01:31:44,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:44,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:44,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:44,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2020-07-29 01:31:44,615 INFO L794 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 233#L10-2 [2020-07-29 01:31:44,616 INFO L796 eck$LassoCheckResult]: Loop: 233#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 230#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 231#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 238#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 237#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 236#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 235#L12-2 assume !(main_~j~0 < 12); 234#L12-3 main_~i~0 := 1 + main_~i~0; 233#L10-2 [2020-07-29 01:31:44,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:44,616 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2020-07-29 01:31:44,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:44,617 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813319227] [2020-07-29 01:31:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:44,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:44,621 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:44,623 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:44,624 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:44,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2020-07-29 01:31:44,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:44,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25270099] [2020-07-29 01:31:44,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:44,727 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {264#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:44,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {265#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:44,730 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {266#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:44,731 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {267#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:44,733 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {268#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:44,734 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {269#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:44,735 INFO L280 TraceCheckUtils]: 6: Hoare triple {269#(<= ULTIMATE.start_main_~j~0 8)} assume !(main_~j~0 < 12); {263#false} is VALID [2020-07-29 01:31:44,735 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} main_~i~0 := 1 + main_~i~0; {263#false} is VALID [2020-07-29 01:31:44,736 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:44,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25270099] [2020-07-29 01:31:44,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116014705] [2020-07-29 01:31:44,736 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:31:44,760 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2020-07-29 01:31:44,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:44,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:44,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:44,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:44,924 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {264#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:44,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {264#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {265#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:44,927 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {266#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:44,928 INFO L280 TraceCheckUtils]: 3: Hoare triple {266#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {267#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:44,929 INFO L280 TraceCheckUtils]: 4: Hoare triple {267#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {268#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:44,930 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {269#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:44,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {269#(<= ULTIMATE.start_main_~j~0 8)} assume !(main_~j~0 < 12); {263#false} is VALID [2020-07-29 01:31:44,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#false} main_~i~0 := 1 + main_~i~0; {263#false} is VALID [2020-07-29 01:31:44,934 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:44,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:44,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-29 01:31:44,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716029249] [2020-07-29 01:31:44,935 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:44,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 01:31:44,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-29 01:31:44,936 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2020-07-29 01:31:44,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:44,987 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:31:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 01:31:44,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 01:31:44,996 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:31:44,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2020-07-29 01:31:44,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:44,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:31:44,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:31:44,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-29 01:31:44,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2020-07-29 01:31:44,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:44,999 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:31:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2020-07-29 01:31:45,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-29 01:31:45,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:45,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:31:45,000 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:31:45,001 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 10 states. [2020-07-29 01:31:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,002 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:31:45,002 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:31:45,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,003 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:31:45,003 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states and 11 transitions. [2020-07-29 01:31:45,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,004 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-29 01:31:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:31:45,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:45,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:45,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:31:45,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-29 01:31:45,007 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:31:45,007 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-29 01:31:45,007 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:31:45,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2020-07-29 01:31:45,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2020-07-29 01:31:45,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:45,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:45,008 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:45,008 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2020-07-29 01:31:45,009 INFO L794 eck$LassoCheckResult]: Stem: 303#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 304#L10-2 [2020-07-29 01:31:45,009 INFO L796 eck$LassoCheckResult]: Loop: 304#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 301#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 302#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 310#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 309#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 308#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 307#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 306#L12-2 assume !(main_~j~0 < 12); 305#L12-3 main_~i~0 := 1 + main_~i~0; 304#L10-2 [2020-07-29 01:31:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2020-07-29 01:31:45,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:45,010 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247502093] [2020-07-29 01:31:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:45,013 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:45,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:45,015 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:45,016 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:45,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:45,017 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2020-07-29 01:31:45,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:45,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966426115] [2020-07-29 01:31:45,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:45,131 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {338#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:45,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {338#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {339#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:45,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {339#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {340#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:45,135 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {341#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:45,136 INFO L280 TraceCheckUtils]: 4: Hoare triple {341#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {342#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:45,137 INFO L280 TraceCheckUtils]: 5: Hoare triple {342#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {343#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:45,138 INFO L280 TraceCheckUtils]: 6: Hoare triple {343#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {344#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:45,139 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(<= ULTIMATE.start_main_~j~0 9)} assume !(main_~j~0 < 12); {337#false} is VALID [2020-07-29 01:31:45,140 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#false} main_~i~0 := 1 + main_~i~0; {337#false} is VALID [2020-07-29 01:31:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:45,140 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966426115] [2020-07-29 01:31:45,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61582838] [2020-07-29 01:31:45,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:45,176 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-07-29 01:31:45,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:45,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:31:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:45,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:45,420 INFO L280 TraceCheckUtils]: 0: Hoare triple {336#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {338#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:45,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {338#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {339#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:45,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {339#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {340#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:45,423 INFO L280 TraceCheckUtils]: 3: Hoare triple {340#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {341#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:45,424 INFO L280 TraceCheckUtils]: 4: Hoare triple {341#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {342#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:45,425 INFO L280 TraceCheckUtils]: 5: Hoare triple {342#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {343#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:45,426 INFO L280 TraceCheckUtils]: 6: Hoare triple {343#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {344#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:45,427 INFO L280 TraceCheckUtils]: 7: Hoare triple {344#(<= ULTIMATE.start_main_~j~0 9)} assume !(main_~j~0 < 12); {337#false} is VALID [2020-07-29 01:31:45,427 INFO L280 TraceCheckUtils]: 8: Hoare triple {337#false} main_~i~0 := 1 + main_~i~0; {337#false} is VALID [2020-07-29 01:31:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:45,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:45,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-29 01:31:45,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964331122] [2020-07-29 01:31:45,429 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:45,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:45,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-29 01:31:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-29 01:31:45,430 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2020-07-29 01:31:45,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,498 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:31:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 01:31:45,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-29 01:31:45,511 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:31:45,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:31:45,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:31:45,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:31:45,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:31:45,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:45,514 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:31:45,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:31:45,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:45,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:31:45,516 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:31:45,516 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 11 states. [2020-07-29 01:31:45,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,517 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:31:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,518 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 12 transitions. [2020-07-29 01:31:45,518 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 12 transitions. [2020-07-29 01:31:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,519 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2020-07-29 01:31:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:45,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:31:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2020-07-29 01:31:45,522 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:31:45,522 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2020-07-29 01:31:45,522 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 01:31:45,522 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2020-07-29 01:31:45,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-07-29 01:31:45,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:45,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:45,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:45,524 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2020-07-29 01:31:45,524 INFO L794 eck$LassoCheckResult]: Stem: 382#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 383#L10-2 [2020-07-29 01:31:45,524 INFO L796 eck$LassoCheckResult]: Loop: 383#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 380#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 381#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 390#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 389#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 388#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 387#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 386#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 385#L12-2 assume !(main_~j~0 < 12); 384#L12-3 main_~i~0 := 1 + main_~i~0; 383#L10-2 [2020-07-29 01:31:45,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2020-07-29 01:31:45,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:45,525 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287938251] [2020-07-29 01:31:45,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:45,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:45,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:45,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:45,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:45,532 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2020-07-29 01:31:45,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:45,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31782375] [2020-07-29 01:31:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:45,649 INFO L280 TraceCheckUtils]: 0: Hoare triple {418#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {420#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:45,650 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {421#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:45,651 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {422#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:45,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {423#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:45,653 INFO L280 TraceCheckUtils]: 4: Hoare triple {423#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {424#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:45,655 INFO L280 TraceCheckUtils]: 5: Hoare triple {424#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {425#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:45,656 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {426#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:45,657 INFO L280 TraceCheckUtils]: 7: Hoare triple {426#(<= ULTIMATE.start_main_~j~0 9)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {427#(<= ULTIMATE.start_main_~j~0 10)} is VALID [2020-07-29 01:31:45,658 INFO L280 TraceCheckUtils]: 8: Hoare triple {427#(<= ULTIMATE.start_main_~j~0 10)} assume !(main_~j~0 < 12); {419#false} is VALID [2020-07-29 01:31:45,658 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#false} main_~i~0 := 1 + main_~i~0; {419#false} is VALID [2020-07-29 01:31:45,658 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:45,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31782375] [2020-07-29 01:31:45,659 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876174588] [2020-07-29 01:31:45,659 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:45,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:45,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 01:31:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:45,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:45,902 INFO L280 TraceCheckUtils]: 0: Hoare triple {418#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {420#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:45,903 INFO L280 TraceCheckUtils]: 1: Hoare triple {420#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {421#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:45,904 INFO L280 TraceCheckUtils]: 2: Hoare triple {421#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {422#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:45,905 INFO L280 TraceCheckUtils]: 3: Hoare triple {422#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {423#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:45,906 INFO L280 TraceCheckUtils]: 4: Hoare triple {423#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {424#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:45,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {424#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {425#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:45,909 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {426#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:45,911 INFO L280 TraceCheckUtils]: 7: Hoare triple {426#(<= ULTIMATE.start_main_~j~0 9)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {427#(<= ULTIMATE.start_main_~j~0 10)} is VALID [2020-07-29 01:31:45,912 INFO L280 TraceCheckUtils]: 8: Hoare triple {427#(<= ULTIMATE.start_main_~j~0 10)} assume !(main_~j~0 < 12); {419#false} is VALID [2020-07-29 01:31:45,912 INFO L280 TraceCheckUtils]: 9: Hoare triple {419#false} main_~i~0 := 1 + main_~i~0; {419#false} is VALID [2020-07-29 01:31:45,913 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:45,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:45,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-29 01:31:45,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441056514] [2020-07-29 01:31:45,914 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:45,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:45,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-29 01:31:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-29 01:31:45,915 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2020-07-29 01:31:45,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,975 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:31:45,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-29 01:31:45,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-29 01:31:45,985 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:31:45,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:31:45,988 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:31:45,988 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:31:45,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:31:45,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:45,989 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:31:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:31:45,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:45,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:31:45,990 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:31:45,991 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 12 states. [2020-07-29 01:31:45,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,992 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:31:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,993 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:31:45,993 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 13 transitions. [2020-07-29 01:31:45,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:45,994 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-29 01:31:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:45,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:45,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:45,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:45,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:31:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-29 01:31:45,997 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:31:45,997 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-29 01:31:45,998 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-29 01:31:45,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2020-07-29 01:31:45,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-07-29 01:31:45,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:45,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:45,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:45,999 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2020-07-29 01:31:46,000 INFO L794 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 470#L10-2 [2020-07-29 01:31:46,000 INFO L796 eck$LassoCheckResult]: Loop: 470#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 467#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 468#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 478#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 477#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 476#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 475#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 474#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 473#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 472#L12-2 assume !(main_~j~0 < 12); 471#L12-3 main_~i~0 := 1 + main_~i~0; 470#L10-2 [2020-07-29 01:31:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2020-07-29 01:31:46,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:46,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109798071] [2020-07-29 01:31:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,005 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,007 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:46,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2020-07-29 01:31:46,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:46,009 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161951440] [2020-07-29 01:31:46,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:46,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {510#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:46,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {510#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {511#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:46,157 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {512#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:46,158 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {513#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:46,159 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {514#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:46,160 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {515#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:46,166 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {516#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:46,167 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(<= ULTIMATE.start_main_~j~0 9)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {517#(<= ULTIMATE.start_main_~j~0 10)} is VALID [2020-07-29 01:31:46,168 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= ULTIMATE.start_main_~j~0 10)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {518#(<= ULTIMATE.start_main_~j~0 11)} is VALID [2020-07-29 01:31:46,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= ULTIMATE.start_main_~j~0 11)} assume !(main_~j~0 < 12); {509#false} is VALID [2020-07-29 01:31:46,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#false} main_~i~0 := 1 + main_~i~0; {509#false} is VALID [2020-07-29 01:31:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:46,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161951440] [2020-07-29 01:31:46,170 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12607567] [2020-07-29 01:31:46,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:31:46,202 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-29 01:31:46,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:31:46,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-29 01:31:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:46,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:46,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {508#true} assume !!(main_~i~0 < 10);main_~j~0 := 3; {510#(<= ULTIMATE.start_main_~j~0 3)} is VALID [2020-07-29 01:31:46,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {510#(<= ULTIMATE.start_main_~j~0 3)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {511#(<= ULTIMATE.start_main_~j~0 4)} is VALID [2020-07-29 01:31:46,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {511#(<= ULTIMATE.start_main_~j~0 4)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {512#(<= ULTIMATE.start_main_~j~0 5)} is VALID [2020-07-29 01:31:46,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {512#(<= ULTIMATE.start_main_~j~0 5)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {513#(<= ULTIMATE.start_main_~j~0 6)} is VALID [2020-07-29 01:31:46,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {513#(<= ULTIMATE.start_main_~j~0 6)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {514#(<= ULTIMATE.start_main_~j~0 7)} is VALID [2020-07-29 01:31:46,437 INFO L280 TraceCheckUtils]: 5: Hoare triple {514#(<= ULTIMATE.start_main_~j~0 7)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {515#(<= ULTIMATE.start_main_~j~0 8)} is VALID [2020-07-29 01:31:46,438 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#(<= ULTIMATE.start_main_~j~0 8)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {516#(<= ULTIMATE.start_main_~j~0 9)} is VALID [2020-07-29 01:31:46,439 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(<= ULTIMATE.start_main_~j~0 9)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {517#(<= ULTIMATE.start_main_~j~0 10)} is VALID [2020-07-29 01:31:46,440 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= ULTIMATE.start_main_~j~0 10)} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {518#(<= ULTIMATE.start_main_~j~0 11)} is VALID [2020-07-29 01:31:46,441 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= ULTIMATE.start_main_~j~0 11)} assume !(main_~j~0 < 12); {509#false} is VALID [2020-07-29 01:31:46,441 INFO L280 TraceCheckUtils]: 10: Hoare triple {509#false} main_~i~0 := 1 + main_~i~0; {509#false} is VALID [2020-07-29 01:31:46,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:31:46,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:31:46,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-29 01:31:46,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859305596] [2020-07-29 01:31:46,443 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:31:46,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:31:46,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-29 01:31:46,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-29 01:31:46,443 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2020-07-29 01:31:46,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:46,501 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:31:46,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:31:46,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-29 01:31:46,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:46,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:31:46,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:31:46,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 01:31:46,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:31:46,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:46,516 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:31:46,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-29 01:31:46,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:46,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:31:46,517 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:31:46,517 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 13 states. [2020-07-29 01:31:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:46,518 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:31:46,519 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:46,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:46,519 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states and 14 transitions. [2020-07-29 01:31:46,520 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states and 14 transitions. [2020-07-29 01:31:46,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:31:46,521 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-29 01:31:46,521 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:46,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:46,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:46,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-29 01:31:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-29 01:31:46,523 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:31:46,523 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-29 01:31:46,523 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-29 01:31:46,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2020-07-29 01:31:46,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-29 01:31:46,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:46,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:46,524 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:31:46,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2020-07-29 01:31:46,525 INFO L794 eck$LassoCheckResult]: Stem: 564#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 565#L10-2 [2020-07-29 01:31:46,525 INFO L796 eck$LassoCheckResult]: Loop: 565#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 562#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 563#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 574#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 573#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 572#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 571#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 570#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 569#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 568#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 567#L12-2 assume !(main_~j~0 < 12); 566#L12-3 main_~i~0 := 1 + main_~i~0; 565#L10-2 [2020-07-29 01:31:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:46,525 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2020-07-29 01:31:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:46,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338068829] [2020-07-29 01:31:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,529 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:46,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:46,532 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2020-07-29 01:31:46,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:46,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142497526] [2020-07-29 01:31:46,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,544 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,555 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,558 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:46,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2020-07-29 01:31:46,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:46,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014054809] [2020-07-29 01:31:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:46,599 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:46,604 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:46,799 WARN L193 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2020-07-29 01:31:46,860 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:46,860 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:46,861 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:46,861 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:46,861 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:46,861 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:46,861 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:46,862 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:46,862 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration10_Loop [2020-07-29 01:31:46,862 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:46,862 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:46,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:46,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:46,912 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:31:46,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:46,925 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:31:47,078 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:47,080 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:31:47,096 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:47,097 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:31:47,110 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:47,110 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:47,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:47,156 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:31:47,162 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:47,162 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:47,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:47,196 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:47,196 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=12} Honda state: {ULTIMATE.start_main_~j~0=12} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:47,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:47,236 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:47,300 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:47,301 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,338 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:47,340 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:47,340 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:47,340 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:47,340 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:47,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:47,341 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,341 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:47,341 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:47,341 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration10_Loop [2020-07-29 01:31:47,341 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:47,341 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:47,353 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:31:47,357 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:31:47,364 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:31:47,367 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:31:47,377 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:31:47,505 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:47,511 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,520 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:31:47,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:47,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:47,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:47,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:47,528 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:47,528 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:47,537 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:31:47,575 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:31:47,577 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:47,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:47,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:47,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:47,580 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:47,580 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:47,582 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:47,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:47,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:47,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:47,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:47,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:47,633 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:47,633 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:47,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:47,670 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:31:47,671 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:47,671 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:47,671 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:47,671 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:47,671 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:47,674 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:47,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:47,677 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:47,680 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:47,680 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:31:47,685 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:47,685 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:47,685 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:47,686 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2020-07-29 01:31:47,714 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:47,718 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < 10);main_~j~0 := 3;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" "assume !(main_~j~0 < 12);" "main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:31:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:47,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:47,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:47,760 INFO L280 TraceCheckUtils]: 0: Hoare triple {610#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; {610#unseeded} is VALID [2020-07-29 01:31:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:47,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:47,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:47,817 INFO L280 TraceCheckUtils]: 0: Hoare triple {613#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 19))} assume !!(main_~i~0 < 10);main_~j~0 := 3; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,818 INFO L280 TraceCheckUtils]: 1: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,819 INFO L280 TraceCheckUtils]: 2: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,820 INFO L280 TraceCheckUtils]: 3: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,821 INFO L280 TraceCheckUtils]: 4: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,822 INFO L280 TraceCheckUtils]: 5: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,825 INFO L280 TraceCheckUtils]: 8: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,826 INFO L280 TraceCheckUtils]: 9: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,827 INFO L280 TraceCheckUtils]: 10: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} assume !(main_~j~0 < 12); {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} is VALID [2020-07-29 01:31:47,829 INFO L280 TraceCheckUtils]: 11: Hoare triple {628#(and (<= 19 (+ oldRank0 (* 2 ULTIMATE.start_main_~i~0))) (< ULTIMATE.start_main_~i~0 10))} main_~i~0 := 1 + main_~i~0; {623#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~i~0) 19))) unseeded)} is VALID [2020-07-29 01:31:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2020-07-29 01:31:47,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:31:47,839 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:31:47,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,846 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:31:47,847 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-07-29 01:31:47,900 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2020-07-29 01:31:47,900 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:31:47,900 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:47,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:31:47,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:47,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:47,901 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:31:47,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:47,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:47,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:47,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2020-07-29 01:31:47,904 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:47,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:47,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:47,906 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2020-07-29 01:31:47,910 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2020-07-29 01:31:47,911 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:31:47,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:31:47,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:47,912 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 28 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:47,912 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:47,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:31:47,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:31:47,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:31:47,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:47,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:47,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:31:47,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:47,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:47,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:47,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:31:47,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:31:47,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 12 letters. [2020-07-29 01:31:47,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:31:47,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:31:47,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 12 letters. [2020-07-29 01:31:47,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:31:47,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:31:47,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:31:47,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:47,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:47,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 12 letters. [2020-07-29 01:31:47,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:47,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:47,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 12 letters. [2020-07-29 01:31:47,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:47,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:47,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 12 letters. [2020-07-29 01:31:47,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:31:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:31:47,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 12 letters. [2020-07-29 01:31:47,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:31:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:31:47,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 12 letters. [2020-07-29 01:31:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:47,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 12 letters. [2020-07-29 01:31:47,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:47,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:47,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 12 letters. [2020-07-29 01:31:47,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:31:47,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 28 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 1 letters. [2020-07-29 01:31:47,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,945 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:31:47,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:47,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2020-07-29 01:31:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2020-07-29 01:31:47,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2020-07-29 01:31:47,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:47,948 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:47,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:47,950 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2020-07-29 01:31:47,950 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:31:47,951 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 01:31:47,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2020-07-29 01:31:47,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:47,951 INFO L688 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2020-07-29 01:31:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2020-07-29 01:31:47,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2020-07-29 01:31:47,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:47,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:31:47,954 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:31:47,954 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 15 states. [2020-07-29 01:31:47,954 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:47,957 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:31:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:31:47,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:47,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:47,958 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 01:31:47,958 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 24 states and 27 transitions. [2020-07-29 01:31:47,959 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:47,960 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2020-07-29 01:31:47,961 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2020-07-29 01:31:47,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:47,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:47,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:47,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:31:47,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-07-29 01:31:47,963 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:31:47,963 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-07-29 01:31:47,963 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-29 01:31:47,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2020-07-29 01:31:47,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:47,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:47,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:47,965 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:31:47,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:47,966 INFO L794 eck$LassoCheckResult]: Stem: 696#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 697#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 693#L12-2 [2020-07-29 01:31:47,966 INFO L796 eck$LassoCheckResult]: Loop: 693#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 693#L12-2 [2020-07-29 01:31:47,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:47,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:31:47,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:47,967 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931162136] [2020-07-29 01:31:47,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,971 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,973 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,974 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:47,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:47,974 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:31:47,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:47,975 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125035324] [2020-07-29 01:31:47,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:47,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,978 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,980 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,981 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:47,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:47,982 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:31:47,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:47,982 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131850824] [2020-07-29 01:31:47,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,986 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:47,988 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:47,989 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:48,008 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:48,009 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:48,009 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:48,009 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:48,009 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:48,009 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:48,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:48,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration11_Loop [2020-07-29 01:31:48,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:48,010 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:48,018 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:31:48,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:31:48,027 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:31:48,038 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:31:48,143 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:48,143 INFO L404 LassoAnalysis]: Checking for nontermination... 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:31:48,155 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:48,155 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:31:48,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:48,160 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 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:31:48,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:48,204 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:31:48,208 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:48,208 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:48,255 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 22 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,314 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:48,314 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,330 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:48,330 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=2}, {ULTIMATE.start_main_~c~0=-1}] Lambdas: [11, 1, 1] Nus: [0, 0] 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) [2020-07-29 01:31:48,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:48,363 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:48,403 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,490 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:48,492 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:48,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:48,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:48,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:48,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:48,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:48,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:48,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration11_Loop [2020-07-29 01:31:48,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:48,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:48,501 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:31:48,508 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:31:48,513 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:31:48,517 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:31:48,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:48,626 INFO L489 LassoAnalysis]: Using template 'affine'. 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:31:48,631 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:31:48,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:48,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:48,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:48,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:48,640 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:48,640 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,645 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,682 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:31:48,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:48,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:48,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:48,684 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,692 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:31:48,692 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:31:48,696 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,735 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:31:48,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:48,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:48,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:48,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:48,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:48,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:48,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:48,740 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:31:48,782 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:48,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:48,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:48,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:48,783 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:48,784 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:48,785 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:31:48,790 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:48,794 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:48,794 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:48,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:48,798 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:48,798 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:48,798 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 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:31:48,823 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:48,825 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" [2020-07-29 01:31:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:48,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:48,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:48,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:48,849 INFO L280 TraceCheckUtils]: 0: Hoare triple {801#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; {801#unseeded} is VALID [2020-07-29 01:31:48,849 INFO L280 TraceCheckUtils]: 1: Hoare triple {801#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {801#unseeded} is VALID [2020-07-29 01:31:48,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:48,854 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:48,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:48,859 INFO L280 TraceCheckUtils]: 0: Hoare triple {804#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {814#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))) unseeded)} is VALID [2020-07-29 01:31:48,859 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:31:48,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:48,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:48,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,863 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:31:48,863 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:31:48,884 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2020-07-29 01:31:48,885 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:31:48,885 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:48,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:48,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,885 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:48,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:48,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-07-29 01:31:48,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:48,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,887 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 18 transitions. cyclomatic complexity: 5 [2020-07-29 01:31:48,888 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:48,888 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:48,888 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:48,888 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:48,888 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 31 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:48,889 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:48,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 31 letters. Loop has 31 letters. [2020-07-29 01:31:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:48,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:48,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:48,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:48,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:48,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:48,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:48,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 18 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 31 states and 36 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:48,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,898 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:48,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:48,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:31:48,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:31:48,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:31:48,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:48,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. cyclomatic complexity: 9 [2020-07-29 01:31:48,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:48,903 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2020-07-29 01:31:48,903 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:31:48,903 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:31:48,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2020-07-29 01:31:48,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:31:48,904 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-29 01:31:48,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2020-07-29 01:31:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2020-07-29 01:31:48,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:31:48,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:31:48,906 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:31:48,906 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 15 states. [2020-07-29 01:31:48,907 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:48,908 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 01:31:48,909 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 01:31:48,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:48,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:48,909 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 27 states and 31 transitions. [2020-07-29 01:31:48,910 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 27 states and 31 transitions. [2020-07-29 01:31:48,910 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:31:48,912 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-29 01:31:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-29 01:31:48,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:31:48,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:31:48,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:31:48,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:31:48,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 01:31:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-29 01:31:48,915 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:31:48,915 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-29 01:31:48,915 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2020-07-29 01:31:48,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2020-07-29 01:31:48,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:48,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:48,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:48,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2020-07-29 01:31:48,916 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:31:48,917 INFO L794 eck$LassoCheckResult]: Stem: 863#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 864#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 861#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 862#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 874#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 873#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 872#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 871#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 870#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 869#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 868#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 867#L12-2 assume !(main_~j~0 < 12); 866#L12-3 main_~i~0 := 1 + main_~i~0; 865#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 860#L12-2 [2020-07-29 01:31:48,917 INFO L796 eck$LassoCheckResult]: Loop: 860#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 860#L12-2 [2020-07-29 01:31:48,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,917 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2020-07-29 01:31:48,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,918 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828562998] [2020-07-29 01:31:48,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,928 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,937 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,940 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,941 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:31:48,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,941 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810922553] [2020-07-29 01:31:48,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,946 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,946 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:48,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:48,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2020-07-29 01:31:48,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:31:48,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963107093] [2020-07-29 01:31:48,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:31:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:31:48,965 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:31:48,968 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:31:49,006 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:49,006 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:49,006 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:49,006 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:49,007 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:31:49,007 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,007 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:49,007 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:49,007 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration12_Loop [2020-07-29 01:31:49,007 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:49,007 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:49,015 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:31:49,020 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:31:49,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:31:49,035 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:31:49,152 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:49,152 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) [2020-07-29 01:31:49,158 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:49,159 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:49,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:49,210 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:31:49,232 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:49,232 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=2}, {ULTIMATE.start_main_~c~0=-1}] Lambdas: [11, 1, 1] Nus: [0, 0] 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) [2020-07-29 01:31:49,271 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:49,271 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,276 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:31:49,276 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:49,311 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:31:49,311 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:49,347 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:31:49,347 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,384 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:31:49,386 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:31:49,386 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:31:49,386 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:31:49,386 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:31:49,386 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:31:49,386 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:31:49,387 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:31:49,387 INFO L133 ssoRankerPreferences]: Filename of dumped script: java_Nested.c_Iteration12_Loop [2020-07-29 01:31:49,387 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:31:49,387 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:31:49,394 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:31:49,399 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:31:49,406 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:31:49,410 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:31:49,497 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:31:49,498 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:31:49,501 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:31:49,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:49,502 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:49,502 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:49,502 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:49,502 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:49,503 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:49,503 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:31:49,505 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) [2020-07-29 01:31:49,534 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:31:49,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:31:49,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:31:49,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:31:49,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:31:49,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:31:49,537 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:31:49,537 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,539 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:31:49,547 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:31:49,547 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:31:49,550 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:31:49,550 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:31:49,550 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:31:49,550 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:31:49,584 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:31:49,586 INFO L393 LassoCheck]: Loop: "assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0;" [2020-07-29 01:31:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,623 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; {1038#unseeded} is VALID [2020-07-29 01:31:49,624 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,624 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,625 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,625 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,625 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,626 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,627 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,627 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,627 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~j~0 < 12); {1038#unseeded} is VALID [2020-07-29 01:31:49,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~i~0 := 1 + main_~i~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,629 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,633 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1051#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))) unseeded)} is VALID [2020-07-29 01:31:49,637 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:31:49,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:49,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:49,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,642 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:31:49,642 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:49,661 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2020-07-29 01:31:49,661 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:31:49,661 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,662 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:49,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,663 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-07-29 01:31:49,663 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,663 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,664 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,664 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,664 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:49,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,665 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 33 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:49,665 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,674 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:49,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,675 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:49,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:49,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; {1038#unseeded} is VALID [2020-07-29 01:31:49,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,711 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,712 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,713 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,715 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~j~0 < 12); {1038#unseeded} is VALID [2020-07-29 01:31:49,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~i~0 := 1 + main_~i~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,716 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,720 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,724 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1051#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))) unseeded)} is VALID [2020-07-29 01:31:49,724 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:31:49,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:49,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:49,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,730 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:31:49,731 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:49,745 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2020-07-29 01:31:49,746 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:31:49,746 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:49,747 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,747 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,747 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 33 transitions. [2020-07-29 01:31:49,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,748 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,748 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,748 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:49,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,749 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,749 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 29 states and 33 transitions. cyclomatic complexity: 7 [2020-07-29 01:31:49,749 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 29 letters. Loop has 29 letters. [2020-07-29 01:31:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 29 states and 33 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,759 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:31:49,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,760 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:31:49,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:31:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,795 INFO L280 TraceCheckUtils]: 0: Hoare triple {1038#unseeded} havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; {1038#unseeded} is VALID [2020-07-29 01:31:49,796 INFO L280 TraceCheckUtils]: 1: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,796 INFO L280 TraceCheckUtils]: 2: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,797 INFO L280 TraceCheckUtils]: 3: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,797 INFO L280 TraceCheckUtils]: 4: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,798 INFO L280 TraceCheckUtils]: 5: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,799 INFO L280 TraceCheckUtils]: 6: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,799 INFO L280 TraceCheckUtils]: 7: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,800 INFO L280 TraceCheckUtils]: 8: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {1038#unseeded} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {1038#unseeded} assume !(main_~j~0 < 12); {1038#unseeded} is VALID [2020-07-29 01:31:49,802 INFO L280 TraceCheckUtils]: 12: Hoare triple {1038#unseeded} main_~i~0 := 1 + main_~i~0; {1038#unseeded} is VALID [2020-07-29 01:31:49,802 INFO L280 TraceCheckUtils]: 13: Hoare triple {1038#unseeded} assume !!(main_~i~0 < 10);main_~j~0 := 3; {1038#unseeded} is VALID [2020-07-29 01:31:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,805 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:31:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:31:49,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:31:49,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {1041#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))} assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; {1051#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~j~0) 23))) unseeded)} is VALID [2020-07-29 01:31:49,810 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:31:49,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:31:49,815 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:31:49,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,815 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:31:49,815 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:31:49,837 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2020-07-29 01:31:49,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:31:49,838 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:31:49,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:31:49,842 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:31:49,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2020-07-29 01:31:49,843 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:49,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:49,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 17 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,843 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,843 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:31:49,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:31:49,844 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:31:49,844 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,845 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:49,845 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:31:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:49,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 01:31:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:31:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:31:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 17 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 20 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:31:49,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,851 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:31:49,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:31:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:31:49,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2020-07-29 01:31:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2020-07-29 01:31:49,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2020-07-29 01:31:49,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:31:49,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. cyclomatic complexity: 4 [2020-07-29 01:31:49,854 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:49,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 01:31:49,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:31:49,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:31:49,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:31:49,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:31:49,854 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:49,854 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:49,855 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:31:49,855 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2020-07-29 01:31:49,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:31:49,855 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:31:49,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:31:49,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:31:49 BoogieIcfgContainer [2020-07-29 01:31:49,862 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:31:49,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:31:49,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:31:49,862 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:31:49,863 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:31:42" (3/4) ... [2020-07-29 01:31:49,866 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:31:49,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:31:49,868 INFO L168 Benchmark]: Toolchain (without parser) took 7819.53 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 304.6 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -137.5 MB). Peak memory consumption was 167.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:49,869 INFO L168 Benchmark]: CDTParser took 0.27 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:31:49,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 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:31:49,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.72 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:31:49,870 INFO L168 Benchmark]: Boogie Preprocessor took 78.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:49,870 INFO L168 Benchmark]: RCFGBuilder took 258.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:49,870 INFO L168 Benchmark]: BuchiAutomizer took 7119.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 914.6 kB). Peak memory consumption was 187.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:31:49,871 INFO L168 Benchmark]: Witness Printer took 4.34 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:31:49,873 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.27 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 322.39 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 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 28.72 ms. Allocated memory is still 1.0 GB. Free memory is still 941.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 941.4 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 258.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.3 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7119.28 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 186.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 914.6 kB). Peak memory consumption was 187.0 MB. Max. memory is 11.5 GB. * Witness Printer took 4.34 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 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 31 SDslu, 52 SDs, 0 SdLazy, 161 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax171 hnf99 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...