./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/gr2006.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- 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/loop-lit/gr2006.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash ba7de983a2c073883000d6964eaf1a21fb1e02fa ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 02:08:07,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 02:08:07,991 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 02:08:08,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 02:08:08,004 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 02:08:08,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 02:08:08,007 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 02:08:08,009 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 02:08:08,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 02:08:08,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 02:08:08,013 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 02:08:08,015 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 02:08:08,015 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 02:08:08,016 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 02:08:08,017 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 02:08:08,019 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 02:08:08,020 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 02:08:08,021 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 02:08:08,023 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 02:08:08,025 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 02:08:08,027 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 02:08:08,028 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 02:08:08,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 02:08:08,030 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 02:08:08,032 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 02:08:08,033 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 02:08:08,033 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 02:08:08,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 02:08:08,035 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 02:08:08,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 02:08:08,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 02:08:08,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 02:08:08,038 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 02:08:08,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 02:08:08,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 02:08:08,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 02:08:08,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 02:08:08,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 02:08:08,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 02:08:08,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 02:08:08,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 02:08:08,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 02:08:08,062 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 02:08:08,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 02:08:08,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 02:08:08,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 02:08:08,064 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 02:08:08,065 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 02:08:08,065 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 02:08:08,065 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 02:08:08,065 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 02:08:08,066 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 02:08:08,066 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 02:08:08,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 02:08:08,067 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 02:08:08,067 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 02:08:08,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 02:08:08,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 02:08:08,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 02:08:08,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 02:08:08,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 02:08:08,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 02:08:08,069 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 02:08:08,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 02:08:08,069 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 02:08:08,070 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 02:08:08,070 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 02:08:08,070 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 02:08:08,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 02:08:08,071 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 02:08:08,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 02:08:08,071 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 02:08:08,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 02:08:08,072 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 02:08:08,073 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 02:08:08,073 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ba7de983a2c073883000d6964eaf1a21fb1e02fa [2020-07-29 02:08:08,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 02:08:08,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 02:08:08,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 02:08:08,425 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 02:08:08,427 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 02:08:08,429 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gr2006.i [2020-07-29 02:08:08,494 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874251578/68c4c77b13124579a34f5f71ef69db2b/FLAG5268924af [2020-07-29 02:08:08,951 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 02:08:08,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gr2006.i [2020-07-29 02:08:08,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874251578/68c4c77b13124579a34f5f71ef69db2b/FLAG5268924af [2020-07-29 02:08:09,366 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/874251578/68c4c77b13124579a34f5f71ef69db2b [2020-07-29 02:08:09,369 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 02:08:09,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 02:08:09,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:09,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 02:08:09,377 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 02:08:09,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dd749ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09, skipping insertion in model container [2020-07-29 02:08:09,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 02:08:09,417 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 02:08:09,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:09,633 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 02:08:09,650 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 02:08:09,665 INFO L208 MainTranslator]: Completed translation [2020-07-29 02:08:09,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09 WrapperNode [2020-07-29 02:08:09,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 02:08:09,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:09,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 02:08:09,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 02:08:09,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 02:08:09,759 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 02:08:09,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 02:08:09,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 02:08:09,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (1/1) ... [2020-07-29 02:08:09,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 02:08:09,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 02:08:09,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 02:08:09,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 02:08:09,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (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 02:08:09,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 02:08:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 02:08:10,090 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 02:08:10,090 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-29 02:08:10,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:10 BoogieIcfgContainer [2020-07-29 02:08:10,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 02:08:10,095 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 02:08:10,095 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 02:08:10,098 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 02:08:10,099 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:10,100 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 02:08:09" (1/3) ... [2020-07-29 02:08:10,101 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c9d89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:10, skipping insertion in model container [2020-07-29 02:08:10,101 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:10,101 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 02:08:09" (2/3) ... [2020-07-29 02:08:10,102 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c9d89e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 02:08:10, skipping insertion in model container [2020-07-29 02:08:10,102 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 02:08:10,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:10" (3/3) ... [2020-07-29 02:08:10,104 INFO L371 chiAutomizerObserver]: Analyzing ICFG gr2006.i [2020-07-29 02:08:10,153 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 02:08:10,153 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 02:08:10,153 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 02:08:10,153 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 02:08:10,154 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 02:08:10,154 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 02:08:10,154 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 02:08:10,154 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 02:08:10,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:08:10,193 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:10,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,193 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,198 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:08:10,198 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:08:10,198 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 02:08:10,198 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:08:10,201 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:10,201 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:10,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:10,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 02:08:10,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:08:10,210 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 3#L17-2true [2020-07-29 02:08:10,211 INFO L796 eck$LassoCheckResult]: Loop: 3#L17-2true assume !false; 10#L18true assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; 6#L18-2true assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 3#L17-2true [2020-07-29 02:08:10,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:10,217 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 02:08:10,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:10,226 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990392567] [2020-07-29 02:08:10,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:10,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,295 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,299 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,317 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:10,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:10,319 INFO L82 PathProgramCache]: Analyzing trace with hash 39825, now seen corresponding path program 1 times [2020-07-29 02:08:10,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:10,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669550293] [2020-07-29 02:08:10,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:10,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:10,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 963346, now seen corresponding path program 1 times [2020-07-29 02:08:10,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:10,342 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536857683] [2020-07-29 02:08:10,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,352 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:10,358 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:10,360 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:10,436 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:10,437 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:10,437 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:10,437 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:10,438 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:10,438 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:10,438 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:10,438 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:10,438 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration1_Loop [2020-07-29 02:08:10,439 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:10,439 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:10,479 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 02:08:10,494 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 02:08:10,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:10,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:10,833 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:10,834 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:10,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:10,843 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:10,854 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:10,854 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post0=0} Honda state: {ULTIMATE.start_main_#t~post0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:10,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:10,902 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:10,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:10,949 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,001 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:11,003 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:11,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:11,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:11,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:11,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:11,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:11,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:11,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration1_Loop [2020-07-29 02:08:11,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:11,006 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:11,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 02:08:11,028 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 02:08:11,047 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 02:08:11,064 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 02:08:11,195 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:11,201 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:11,207 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 02:08:11,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:11,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:11,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:11,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:11,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:11,215 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:11,215 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,219 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:11,260 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 02:08:11,262 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:11,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:11,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:11,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:11,263 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:11,265 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:11,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,270 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:11,277 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:11,278 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:11,284 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:11,285 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:11,285 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:11,286 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 99 Supporting invariants [] Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,326 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:11,331 INFO L393 LassoCheck]: Loop: "assume !false;" "assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0;" "assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2;" [2020-07-29 02:08:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:11,397 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#unseeded} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {21#unseeded} is VALID [2020-07-29 02:08:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:11,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 99))} assume !false; {24#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 99))} is VALID [2020-07-29 02:08:11,439 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 99))} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {42#(and (<= 99 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 50))} is VALID [2020-07-29 02:08:11,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {42#(and (<= 99 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (< ULTIMATE.start_main_~x~0 50))} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {34#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 99))) unseeded)} is VALID [2020-07-29 02:08:11,441 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 02:08:11,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:11,463 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 02:08:11,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,475 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 02:08:11,477 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-07-29 02:08:11,605 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 47 states and 59 transitions. Complement of second has 7 states. [2020-07-29 02:08:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:11,606 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:11,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-07-29 02:08:11,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:11,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:11,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:11,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:11,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:08:11,613 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:11,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:11,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 59 transitions. [2020-07-29 02:08:11,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:11,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:11,617 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:11,620 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states. [2020-07-29 02:08:11,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:11,623 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:11,623 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:11,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 02:08:11,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 02:08:11,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 47 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 02:08:11,628 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:11,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:11,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 47 letters. Loop has 47 letters. [2020-07-29 02:08:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:11,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:11,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:11,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 5 letters. [2020-07-29 02:08:11,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:11,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:11,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:11,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:11,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 2 letters. Loop has 1 letters. [2020-07-29 02:08:11,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:11,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:11,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:11,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:11,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:11,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:11,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 47 states and 59 transitions. cyclomatic complexity: 14 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:11,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,654 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:11,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-07-29 02:08:11,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 02:08:11,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:11,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 02:08:11,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:11,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 59 transitions. cyclomatic complexity: 14 [2020-07-29 02:08:11,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:11,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 11 states and 14 transitions. [2020-07-29 02:08:11,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:11,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 02:08:11,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 02:08:11,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:11,676 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 02:08:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 02:08:11,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 02:08:11,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:11,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 02:08:11,706 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 02:08:11,709 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 02:08:11,712 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:11,715 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 02:08:11,716 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 02:08:11,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:11,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:11,718 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 02:08:11,718 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 02:08:11,719 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:11,720 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 02:08:11,721 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 02:08:11,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:11,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:11,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:11,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 02:08:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 02:08:11,725 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 02:08:11,725 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 02:08:11,725 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 02:08:11,726 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 02:08:11,726 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:11,727 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:11,727 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:11,727 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 02:08:11,727 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:08:11,728 INFO L794 eck$LassoCheckResult]: Stem: 110#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 111#L17-2 assume !false; 104#L18 [2020-07-29 02:08:11,728 INFO L796 eck$LassoCheckResult]: Loop: 104#L18 assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; 107#L18-2 assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 103#L17-2 assume !false; 104#L18 [2020-07-29 02:08:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 02:08:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:11,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143308892] [2020-07-29 02:08:11,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:11,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:11,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:11,736 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:11,738 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 44867, now seen corresponding path program 1 times [2020-07-29 02:08:11,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:11,739 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467651208] [2020-07-29 02:08:11,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:11,745 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:11,750 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:11,751 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:11,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:11,752 INFO L82 PathProgramCache]: Analyzing trace with hash 29865658, now seen corresponding path program 1 times [2020-07-29 02:08:11,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:11,753 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153440919] [2020-07-29 02:08:11,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:11,798 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {168#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:11,799 INFO L280 TraceCheckUtils]: 1: Hoare triple {168#(<= ULTIMATE.start_main_~x~0 0)} assume !false; {168#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:11,800 INFO L280 TraceCheckUtils]: 2: Hoare triple {168#(<= ULTIMATE.start_main_~x~0 0)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {167#false} is VALID [2020-07-29 02:08:11,800 INFO L280 TraceCheckUtils]: 3: Hoare triple {167#false} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {167#false} is VALID [2020-07-29 02:08:11,800 INFO L280 TraceCheckUtils]: 4: Hoare triple {167#false} assume !false; {167#false} is VALID [2020-07-29 02:08:11,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:11,802 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153440919] [2020-07-29 02:08:11,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 02:08:11,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 02:08:11,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048264135] [2020-07-29 02:08:11,840 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:11,841 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:11,841 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:11,841 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:11,841 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:11,841 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:11,841 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:11,841 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:11,842 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration2_Loop [2020-07-29 02:08:11,842 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:11,842 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:11,855 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 02:08:11,860 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 02:08:11,875 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 02:08:11,891 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 02:08:12,044 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:12,044 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:12,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:12,051 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,056 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:12,056 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post2=0} Honda state: {ULTIMATE.start_main_#t~post2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:12,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:12,113 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 02:08:12,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:12,169 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 02:08:12,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:12,181 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=50} Honda state: {ULTIMATE.start_main_~x~0=50} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0=0}, {ULTIMATE.start_main_~x~0=1}, {ULTIMATE.start_main_~x~0=0}] Lambdas: [2, 1, 11] Nus: [0, 0] 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 02:08:12,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:12,232 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 02:08:12,237 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 02:08:12,237 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post1=0} Honda state: {ULTIMATE.start_main_#t~post1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:12,299 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:12,299 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,352 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:12,352 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 02:08:12,437 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:12,440 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:12,440 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:12,440 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:12,440 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:12,440 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:12,440 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,441 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:12,441 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:12,441 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration2_Loop [2020-07-29 02:08:12,441 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:12,441 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:12,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:12,462 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 02:08:12,473 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 02:08:12,477 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 02:08:12,603 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:12,603 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,611 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 02:08:12,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:12,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:12,613 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:12,613 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:12,613 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:12,614 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:12,615 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:12,616 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 02:08:12,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:12,655 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:12,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:12,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:12,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:12,657 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:12,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:12,659 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 02:08:12,704 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 02:08:12,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:12,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:12,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:12,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:12,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:12,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:12,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:12,738 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 02:08:12,739 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:12,740 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:12,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:12,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:12,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:12,741 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:12,741 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 02:08:12,743 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:12,751 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 02:08:12,751 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 02:08:12,755 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:12,755 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:12,755 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:12,755 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 02:08:12,778 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:12,782 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1;" "assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2;" "assume !false;" [2020-07-29 02:08:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:12,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:12,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:12,830 INFO L280 TraceCheckUtils]: 0: Hoare triple {169#unseeded} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {169#unseeded} is VALID [2020-07-29 02:08:12,831 INFO L280 TraceCheckUtils]: 1: Hoare triple {169#unseeded} assume !false; {169#unseeded} is VALID [2020-07-29 02:08:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:12,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:12,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:12,941 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {190#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 02:08:12,942 INFO L280 TraceCheckUtils]: 1: Hoare triple {190#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {194#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 02:08:12,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {194#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} assume !false; {182#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 02:08:12,944 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 02:08:12,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:12,956 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 02:08:12,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:12,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:12,957 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:08:12,957 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2020-07-29 02:08:12,995 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 23 states and 29 transitions. Complement of second has 7 states. [2020-07-29 02:08:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:12,996 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:12,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 02:08:12,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:12,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:12,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:12,997 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:12,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:12,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:12,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-07-29 02:08:12,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:12,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:12,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:12,999 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 02:08:13,000 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:13,000 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:13,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:13,001 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:13,001 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 29 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:13,002 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:13,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,002 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 23 letters. Loop has 23 letters. [2020-07-29 02:08:13,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 02:08:13,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 23 letters. Loop has 23 letters. [2020-07-29 02:08:13,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 10 letters. [2020-07-29 02:08:13,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 02:08:13,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 10 letters. Loop has 10 letters. [2020-07-29 02:08:13,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:13,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:13,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:13,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:13,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:13,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 4 letters. Loop has 3 letters. [2020-07-29 02:08:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 02:08:13,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:13,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 29 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,017 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:13,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:13,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2020-07-29 02:08:13,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 02:08:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 02:08:13,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 29 transitions. cyclomatic complexity: 10 [2020-07-29 02:08:13,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:13,023 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 15 states and 19 transitions. [2020-07-29 02:08:13,023 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:13,023 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 02:08:13,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2020-07-29 02:08:13,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:13,023 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 02:08:13,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2020-07-29 02:08:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 02:08:13,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:13,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 19 transitions. Second operand 15 states. [2020-07-29 02:08:13,026 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 19 transitions. Second operand 15 states. [2020-07-29 02:08:13,026 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 15 states. [2020-07-29 02:08:13,026 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:13,028 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 02:08:13,028 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 02:08:13,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:13,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:13,029 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 19 transitions. [2020-07-29 02:08:13,029 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 19 transitions. [2020-07-29 02:08:13,029 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:13,031 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2020-07-29 02:08:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2020-07-29 02:08:13,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:13,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:13,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:13,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 02:08:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 02:08:13,034 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 02:08:13,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:13,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 02:08:13,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 02:08:13,037 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand 3 states. [2020-07-29 02:08:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:13,058 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 02:08:13,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 02:08:13,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 02:08:13,065 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 02:08:13,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 02:08:13,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:13,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 02:08:13,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 02:08:13,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 02:08:13,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2020-07-29 02:08:13,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 02:08:13,069 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 02:08:13,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2020-07-29 02:08:13,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 02:08:13,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 02:08:13,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 02:08:13,071 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 02:08:13,071 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 02:08:13,072 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:13,073 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 02:08:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 02:08:13,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:13,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:13,091 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 02:08:13,091 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 02:08:13,092 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 02:08:13,093 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 02:08:13,093 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 02:08:13,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 02:08:13,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 02:08:13,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 02:08:13,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 02:08:13,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 02:08:13,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 02:08:13,095 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 02:08:13,095 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 02:08:13,095 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 02:08:13,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:13,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:13,095 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:13,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:13,096 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 02:08:13,096 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 02:08:13,096 INFO L794 eck$LassoCheckResult]: Stem: 338#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 330#L17-2 assume !false; 331#L18 assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; 336#L18-2 assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 337#L17-2 assume !false; 339#L18 [2020-07-29 02:08:13,096 INFO L796 eck$LassoCheckResult]: Loop: 339#L18 assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; 334#L18-2 assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; 335#L17-2 assume !false; 339#L18 [2020-07-29 02:08:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:13,098 INFO L82 PathProgramCache]: Analyzing trace with hash 29863736, now seen corresponding path program 2 times [2020-07-29 02:08:13,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:13,098 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64269535] [2020-07-29 02:08:13,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:13,123 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:13,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:13,136 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:13,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:13,137 INFO L82 PathProgramCache]: Analyzing trace with hash 44867, now seen corresponding path program 2 times [2020-07-29 02:08:13,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:13,140 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379049801] [2020-07-29 02:08:13,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:13,149 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:13,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 02:08:13,164 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 02:08:13,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 02:08:13,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:13,169 INFO L82 PathProgramCache]: Analyzing trace with hash 612343980, now seen corresponding path program 1 times [2020-07-29 02:08:13,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 02:08:13,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125037555] [2020-07-29 02:08:13,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 02:08:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,249 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume !false; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,251 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,252 INFO L280 TraceCheckUtils]: 3: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {406#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 02:08:13,253 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#(<= ULTIMATE.start_main_~x~0 1)} assume !false; {406#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 02:08:13,254 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#(<= ULTIMATE.start_main_~x~0 1)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {404#false} is VALID [2020-07-29 02:08:13,254 INFO L280 TraceCheckUtils]: 6: Hoare triple {404#false} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {404#false} is VALID [2020-07-29 02:08:13,254 INFO L280 TraceCheckUtils]: 7: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-29 02:08:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:13,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125037555] [2020-07-29 02:08:13,255 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352370299] [2020-07-29 02:08:13,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 02:08:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 02:08:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:13,357 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,358 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume !false; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,359 INFO L280 TraceCheckUtils]: 2: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {405#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 02:08:13,360 INFO L280 TraceCheckUtils]: 3: Hoare triple {405#(<= ULTIMATE.start_main_~x~0 0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {406#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 02:08:13,361 INFO L280 TraceCheckUtils]: 4: Hoare triple {406#(<= ULTIMATE.start_main_~x~0 1)} assume !false; {406#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 02:08:13,362 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#(<= ULTIMATE.start_main_~x~0 1)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {404#false} is VALID [2020-07-29 02:08:13,363 INFO L280 TraceCheckUtils]: 6: Hoare triple {404#false} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {404#false} is VALID [2020-07-29 02:08:13,363 INFO L280 TraceCheckUtils]: 7: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-29 02:08:13,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 02:08:13,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 02:08:13,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 02:08:13,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990984634] [2020-07-29 02:08:13,389 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:13,389 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:13,389 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:13,389 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:13,389 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 02:08:13,389 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,389 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:13,390 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:13,390 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration3_Loop [2020-07-29 02:08:13,390 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:13,390 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:13,396 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 02:08:13,405 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 02:08:13,409 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 02:08:13,418 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 02:08:13,536 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:13,536 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) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 02:08:13,544 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) [2020-07-29 02:08:13,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 02:08:13,576 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,641 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 02:08:13,643 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 02:08:13,643 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 02:08:13,643 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 02:08:13,643 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 02:08:13,643 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 02:08:13,643 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,643 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 02:08:13,643 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 02:08:13,644 INFO L133 ssoRankerPreferences]: Filename of dumped script: gr2006.i_Iteration3_Loop [2020-07-29 02:08:13,644 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 02:08:13,644 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 02:08:13,654 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 02:08:13,662 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 02:08:13,667 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 02:08:13,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 02:08:13,773 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 02:08:13,774 INFO L489 LassoAnalysis]: Using template 'affine'. 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 02:08:13,785 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 02:08:13,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 02:08:13,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 02:08:13,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 02:08:13,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 02:08:13,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 02:08:13,788 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 02:08:13,788 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,791 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 02:08:13,794 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 02:08:13,794 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 02:08:13,797 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 02:08:13,798 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 02:08:13,798 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 02:08:13,798 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2020-07-29 02:08:13,825 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 02:08:13,828 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1;" "assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2;" "assume !false;" [2020-07-29 02:08:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:13,860 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#unseeded} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {428#unseeded} is VALID [2020-07-29 02:08:13,861 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:13,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#unseeded} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {428#unseeded} is VALID [2020-07-29 02:08:13,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#unseeded} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {428#unseeded} is VALID [2020-07-29 02:08:13,864 INFO L280 TraceCheckUtils]: 4: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:13,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {458#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 02:08:13,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {458#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {462#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 02:08:13,930 INFO L280 TraceCheckUtils]: 2: Hoare triple {462#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} assume !false; {441#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 02:08:13,930 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 02:08:13,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:13,938 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 02:08:13,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,939 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:08:13,939 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 02:08:13,952 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 11 states and 13 transitions. Complement of second has 3 states. [2020-07-29 02:08:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:13,952 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:13,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:13,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:13,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:13,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:13,953 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:13,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:13,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:13,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:13,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:13,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:13,955 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:13,955 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:13,956 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:13,956 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:13,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 02:08:13,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:13,956 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:13,957 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:13,957 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:13,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:13,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:13,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:13,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:13,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:13,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:13,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,968 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 02:08:13,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:13,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:13,969 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:13,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:13,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:13,998 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#unseeded} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {428#unseeded} is VALID [2020-07-29 02:08:13,999 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:14,000 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#unseeded} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {428#unseeded} is VALID [2020-07-29 02:08:14,001 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#unseeded} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {428#unseeded} is VALID [2020-07-29 02:08:14,001 INFO L280 TraceCheckUtils]: 4: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:14,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {497#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 02:08:14,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {497#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {501#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 02:08:14,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {501#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} assume !false; {441#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 02:08:14,069 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 02:08:14,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:14,077 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 02:08:14,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:08:14,078 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 02:08:14,087 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 11 states and 13 transitions. Complement of second has 3 states. [2020-07-29 02:08:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:14,088 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:14,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:14,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:14,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:14,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:14,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:14,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 02:08:14,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:14,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:14,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:14,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:14,090 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:14,090 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:14,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 02:08:14,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:14,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:14,091 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:14,091 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:14,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:14,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:14,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 2 letters. Loop has 2 letters. [2020-07-29 02:08:14,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,100 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 02:08:14,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,101 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 02:08:14,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 02:08:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 02:08:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:14,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {428#unseeded} havoc main_#res;havoc main_#t~post0, main_#t~post1, main_#t~post2, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {428#unseeded} is VALID [2020-07-29 02:08:14,135 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:14,135 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#unseeded} assume main_~x~0 < 50;main_#t~post0 := main_~y~0;main_~y~0 := 1 + main_#t~post0;havoc main_#t~post0; {428#unseeded} is VALID [2020-07-29 02:08:14,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {428#unseeded} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {428#unseeded} is VALID [2020-07-29 02:08:14,137 INFO L280 TraceCheckUtils]: 4: Hoare triple {428#unseeded} assume !false; {428#unseeded} is VALID [2020-07-29 02:08:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 02:08:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 02:08:14,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 02:08:14,221 INFO L280 TraceCheckUtils]: 0: Hoare triple {431#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 < 50);main_#t~post1 := main_~y~0;main_~y~0 := main_#t~post1 - 1;havoc main_#t~post1; {536#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 02:08:14,226 INFO L280 TraceCheckUtils]: 1: Hoare triple {536#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !(main_~y~0 < 0);main_#t~post2 := main_~x~0;main_~x~0 := 1 + main_#t~post2;havoc main_#t~post2; {540#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} is VALID [2020-07-29 02:08:14,227 INFO L280 TraceCheckUtils]: 2: Hoare triple {540#(and (<= (+ ULTIMATE.start_main_~y~0 1) oldRank0) (<= 0 ULTIMATE.start_main_~y~0))} assume !false; {441#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 02:08:14,227 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 02:08:14,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:14,236 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 02:08:14,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,237 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 02:08:14,238 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 4 states. [2020-07-29 02:08:14,281 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 18 states and 22 transitions. Complement of second has 6 states. [2020-07-29 02:08:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 02:08:14,281 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:14,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:14,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:14,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:14,282 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 02:08:14,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:14,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 02:08:14,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 02:08:14,283 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. [2020-07-29 02:08:14,284 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:14,284 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 02:08:14,284 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 02:08:14,284 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 02:08:14,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 02:08:14,285 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 02:08:14,285 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states and 22 transitions. cyclomatic complexity: 6 [2020-07-29 02:08:14,285 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 22 transitions. cyclomatic complexity: 6 [2020-07-29 02:08:14,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:14,286 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 02:08:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 18 letters. Loop has 18 letters. [2020-07-29 02:08:14,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 02:08:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 18 letters. Loop has 18 letters. [2020-07-29 02:08:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 11 letters. [2020-07-29 02:08:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 02:08:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 6 letters. Loop has 3 letters. [2020-07-29 02:08:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 3 letters. [2020-07-29 02:08:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states and 22 transitions. cyclomatic complexity: 6 Stem has 1 letters. Loop has 2 letters. [2020-07-29 02:08:14,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,293 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 02:08:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 02:08:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2020-07-29 02:08:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 02:08:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 02:08:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 02:08:14,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 02:08:14,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 22 transitions. cyclomatic complexity: 6 [2020-07-29 02:08:14,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-29 02:08:14,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:14,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:14,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:14,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:14,296 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:14,296 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:14,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 02:08:14,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 02:08:14,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 02:08:14,297 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 02:08:14,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 02:08:14,297 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 02:08:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 02:08:14,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 02:08:14,308 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 02:08:14,308 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 02:08:14,308 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 02:08:14,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 02:08:14,309 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 02:08:14,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 02:08:14,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 02:08:14,309 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:14,309 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:14,309 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 02:08:14,309 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 02:08:14,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 02:08:14,310 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 02:08:14,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 02:08:14,317 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 02:08:14 BoogieIcfgContainer [2020-07-29 02:08:14,317 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 02:08:14,317 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 02:08:14,317 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 02:08:14,317 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 02:08:14,318 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 02:08:10" (3/4) ... [2020-07-29 02:08:14,322 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 02:08:14,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 02:08:14,325 INFO L168 Benchmark]: Toolchain (without parser) took 4954.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 961.6 MB in the beginning and 1.0 GB in the end (delta: -63.1 MB). Peak memory consumption was 147.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,326 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:14,326 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,327 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,328 INFO L168 Benchmark]: Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,329 INFO L168 Benchmark]: RCFGBuilder took 310.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,329 INFO L168 Benchmark]: BuchiAutomizer took 4221.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.9 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. [2020-07-29 02:08:14,330 INFO L168 Benchmark]: Witness Printer took 5.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 02:08:14,334 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.32 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.80 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 310.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4221.96 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.9 MB). Peak memory consumption was 156.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * x + 99 and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 49 SDslu, 19 SDs, 0 SdLazy, 36 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf91 lsp55 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...