./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0455ba49274114922cfe1b7739d9cb0a89e6c868 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:44,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:44,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:44,736 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:44,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:44,738 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:44,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:44,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:44,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:44,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:44,745 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:44,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:44,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:44,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:44,749 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:44,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:44,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:44,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:44,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:44,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:44,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:44,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:44,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:44,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:44,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:44,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:44,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:44,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:44,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:44,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:44,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:44,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:44,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:44,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:44,771 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:44,771 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:44,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:44,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:44,772 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:44,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:44,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:44,775 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:44,798 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:44,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:44,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:44,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:44,800 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:44,800 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:44,800 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:44,801 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:44,801 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:44,801 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:44,801 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:44,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:44,802 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:44,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:44,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:44,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:44,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:44,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:44,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:44,803 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:44,804 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:44,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:44,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:44,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:44,804 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:44,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:44,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:44,805 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:44,805 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:44,806 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:44,806 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0455ba49274114922cfe1b7739d9cb0a89e6c868 [2020-07-29 01:28:45,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:45,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:45,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:45,132 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:45,133 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:45,134 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2020-07-29 01:28:45,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d3c2e5c/8665abfd1fbc462a9bac307eb8af0abd/FLAG3befac01d [2020-07-29 01:28:45,549 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:45,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2020-07-29 01:28:45,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d3c2e5c/8665abfd1fbc462a9bac307eb8af0abd/FLAG3befac01d [2020-07-29 01:28:45,938 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d3c2e5c/8665abfd1fbc462a9bac307eb8af0abd [2020-07-29 01:28:45,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:45,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:45,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:45,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:45,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:45,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:45" (1/1) ... [2020-07-29 01:28:45,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a8b1fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:45, skipping insertion in model container [2020-07-29 01:28:45,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:45" (1/1) ... [2020-07-29 01:28:45,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:45,982 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:46,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:46,137 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:46,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:46,170 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:46,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46 WrapperNode [2020-07-29 01:28:46,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:46,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:46,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:46,172 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:46,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,188 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:46,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:46,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:46,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:46,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,223 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... [2020-07-29 01:28:46,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:46,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:46,288 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:46,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:46,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:46,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:46,570 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:46,571 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:46,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:46 BoogieIcfgContainer [2020-07-29 01:28:46,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:46,575 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:46,575 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:46,579 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:46,581 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,581 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:45" (1/3) ... [2020-07-29 01:28:46,582 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18db1168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:46, skipping insertion in model container [2020-07-29 01:28:46,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,583 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:46" (2/3) ... [2020-07-29 01:28:46,583 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18db1168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:46, skipping insertion in model container [2020-07-29 01:28:46,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:46,584 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:46" (3/3) ... [2020-07-29 01:28:46,586 INFO L371 chiAutomizerObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a.c [2020-07-29 01:28:46,641 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:46,642 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:46,642 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:46,643 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:46,643 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:46,643 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:46,643 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:46,644 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:46,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:46,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:46,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,690 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:46,690 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:46,690 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:46,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:46,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:46,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:46,694 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:46,702 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 6#L18-2true [2020-07-29 01:28:46,703 INFO L796 eck$LassoCheckResult]: Loop: 6#L18-2true assume !!(main_~y~0 >= 0); 9#L19true assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; 7#L19-2true main_~x~0 := 1 + main_~x~0; 6#L18-2true [2020-07-29 01:28:46,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,709 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:46,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,721 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217163557] [2020-07-29 01:28:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,806 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,810 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,826 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,828 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2020-07-29 01:28:46,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,829 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168080418] [2020-07-29 01:28:46,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,847 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,849 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,852 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2020-07-29 01:28:46,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441194675] [2020-07-29 01:28:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,863 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,869 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,871 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,948 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,949 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,949 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,949 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,949 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:46,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,950 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration1_Loop [2020-07-29 01:28:46,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,951 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,276 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,277 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,283 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,294 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,295 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,328 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,334 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,334 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,369 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,369 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:47,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:47,408 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,408 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=0} Honda state: {ULTIMATE.start_main_~y~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~y~0=0}, {ULTIMATE.start_main_~y~0=0}, {ULTIMATE.start_main_~y~0=1}] Lambdas: [9, 1, 1] Nus: [0, 0] 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,445 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,445 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,481 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:47,481 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:47,513 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:47,515 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,515 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,515 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,516 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,516 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:47,516 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,517 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,517 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,517 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration1_Loop [2020-07-29 01:28:47,517 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,518 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,700 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,705 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,719 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,721 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,728 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,728 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,734 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,836 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:47,886 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:47,891 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:47,891 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,902 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:47,902 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:47,903 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:47,903 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = -2*ULTIMATE.start_main_~x~0 + 101 Supporting invariants [] Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,944 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:47,948 INFO L393 LassoCheck]: Loop: "assume !!(main_~y~0 >= 0);" "assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0;" "main_~x~0 := 1 + main_~x~0;" [2020-07-29 01:28:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:48,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:48,013 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {18#unseeded} is VALID [2020-07-29 01:28:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,020 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:48,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 101))} assume !!(main_~y~0 >= 0); {21#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 101))} is VALID [2020-07-29 01:28:48,054 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 101))} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {39#(and (<= 101 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~x~0 50))} is VALID [2020-07-29 01:28:48,055 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#(and (<= 101 (+ oldRank0 (* 2 ULTIMATE.start_main_~x~0))) (<= ULTIMATE.start_main_~x~0 50))} main_~x~0 := 1 + main_~x~0; {31#(or (and (> oldRank0 (+ (* (- 2) ULTIMATE.start_main_~x~0) 101)) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:48,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:48,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:48,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:48,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:48,099 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 4 states. [2020-07-29 01:28:48,204 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 4 states. Result 25 states and 35 transitions. Complement of second has 7 states. [2020-07-29 01:28:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:48,205 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:48,205 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:48,207 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:48,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:28:48,218 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:48,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2020-07-29 01:28:48,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:48,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,226 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:48,229 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:48,230 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:48,230 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:28:48,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2020-07-29 01:28:48,236 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:48,236 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 35 transitions. cyclomatic complexity: 12 [2020-07-29 01:28:48,239 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:48,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:48,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 25 letters. Loop has 25 letters. [2020-07-29 01:28:48,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:48,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:48,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:48,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:48,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:48,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:48,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,264 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,264 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:48,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,265 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:48,265 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:48,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:48,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:48,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:48,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:48,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:48,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:48,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:48,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:48,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 35 transitions. cyclomatic complexity: 12 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:48,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,290 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:28:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 17 transitions. [2020-07-29 01:28:48,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:28:48,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:48,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 17 transitions. Stem has 1 letters. Loop has 6 letters. [2020-07-29 01:28:48,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:48,298 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 35 transitions. cyclomatic complexity: 12 [2020-07-29 01:28:48,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:48,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 11 states and 14 transitions. [2020-07-29 01:28:48,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:48,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:28:48,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2020-07-29 01:28:48,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:48,320 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2020-07-29 01:28:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2020-07-29 01:28:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-29 01:28:48,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:48,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:48,350 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:48,353 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 10 states. [2020-07-29 01:28:48,356 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,359 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2020-07-29 01:28:48,359 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:28:48,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,360 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:28:48,360 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 11 states and 14 transitions. [2020-07-29 01:28:48,360 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:48,362 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:28:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:28:48,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:48,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:48,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:48,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:28:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-29 01:28:48,366 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:28:48,366 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-29 01:28:48,366 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:48,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2020-07-29 01:28:48,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:48,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:48,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:48,367 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:48,367 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:48,368 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 83#L18-2 assume !!(main_~y~0 >= 0); 79#L19 [2020-07-29 01:28:48,368 INFO L796 eck$LassoCheckResult]: Loop: 79#L19 assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; 84#L19-2 main_~x~0 := 1 + main_~x~0; 78#L18-2 assume !!(main_~y~0 >= 0); 79#L19 [2020-07-29 01:28:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:28:48,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,369 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429178212] [2020-07-29 01:28:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,373 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,376 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,377 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,377 INFO L82 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 1 times [2020-07-29 01:28:48,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598717768] [2020-07-29 01:28:48,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,383 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:48,387 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:48,388 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash 29865534, now seen corresponding path program 1 times [2020-07-29 01:28:48,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:48,390 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118367837] [2020-07-29 01:28:48,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:48,442 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {143#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:48,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {143#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~y~0 >= 0); {143#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:48,444 INFO L280 TraceCheckUtils]: 2: Hoare triple {143#(<= ULTIMATE.start_main_~x~0 0)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {142#false} is VALID [2020-07-29 01:28:48,445 INFO L280 TraceCheckUtils]: 3: Hoare triple {142#false} main_~x~0 := 1 + main_~x~0; {142#false} is VALID [2020-07-29 01:28:48,445 INFO L280 TraceCheckUtils]: 4: Hoare triple {142#false} assume !!(main_~y~0 >= 0); {142#false} is VALID [2020-07-29 01:28:48,446 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 01:28:48,447 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118367837] [2020-07-29 01:28:48,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:48,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:28:48,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129151222] [2020-07-29 01:28:48,483 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:48,483 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:48,483 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:48,484 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:48,484 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:48,484 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,484 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:48,484 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:48,484 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration2_Loop [2020-07-29 01:28:48,484 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:48,485 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:48,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 01:28:48,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:48,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:48,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:48,643 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:48,643 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,647 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,647 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,653 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,653 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,706 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,706 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,713 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,713 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,751 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,797 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,797 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:48,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=51} Honda state: {ULTIMATE.start_main_~x~0=51} Generalized eigenvectors: [{ULTIMATE.start_main_~x~0=1}, {ULTIMATE.start_main_~x~0=0}, {ULTIMATE.start_main_~x~0=0}] Lambdas: [1, 0, 1] Nus: [1, 0] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:48,863 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:48,863 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:48,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:48,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:49,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:49,003 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:49,003 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:49,003 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:49,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:49,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:49,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:49,004 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:49,004 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration2_Loop [2020-07-29 01:28:49,004 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:49,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:49,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,151 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:49,152 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:49,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:49,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:49,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,169 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:49,169 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,212 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:49,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:49,214 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,214 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:49,214 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,216 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:49,216 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:49,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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:49,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,254 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:49,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,257 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:49,257 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:49,261 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:49,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:49,313 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:49,313 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:49,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:49,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:49,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:49,315 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:49,315 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:49,318 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,323 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:49,323 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,329 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:49,330 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:49,330 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:49,330 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 01:28:49,362 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:49,367 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1;" "main_~x~0 := 1 + main_~x~0;" "assume !!(main_~y~0 >= 0);" [2020-07-29 01:28:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,398 INFO L280 TraceCheckUtils]: 0: Hoare triple {144#unseeded} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {144#unseeded} is VALID [2020-07-29 01:28:49,399 INFO L280 TraceCheckUtils]: 1: Hoare triple {144#unseeded} assume !!(main_~y~0 >= 0); {144#unseeded} is VALID [2020-07-29 01:28:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,404 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {147#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {165#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:49,515 INFO L280 TraceCheckUtils]: 1: Hoare triple {165#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := 1 + main_~x~0; {165#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:49,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {165#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~y~0 >= 0); {157#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:49,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:49,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:49,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,540 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:49,540 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:28:49,640 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 21 states and 26 transitions. Complement of second has 5 states. [2020-07-29 01:28:49,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:49,640 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:49,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,640 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:49,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,641 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2020-07-29 01:28:49,642 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:49,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,643 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 13 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:49,643 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:49,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:49,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:49,644 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:49,644 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:49,645 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:49,645 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 01:28:49,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,646 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 01:28:49,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:49,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:49,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,647 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 01:28:49,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:49,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:49,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 13 transitions. cyclomatic complexity: 5 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:49,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:49,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 21 letters. Loop has 21 letters. [2020-07-29 01:28:49,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,649 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 01:28:49,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:49,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:28:49,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,650 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 01:28:49,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:49,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:49,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,650 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 01:28:49,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:49,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:49,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,651 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 01:28:49,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:49,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 3 letters. [2020-07-29 01:28:49,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,652 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 01:28:49,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,653 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 01:28:49,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:49,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:49,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,654 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 01:28:49,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:49,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:49,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,655 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 01:28:49,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:49,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:49,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,656 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 01:28:49,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:49,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 26 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:49,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,657 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:49,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 3 letters. [2020-07-29 01:28:49,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:49,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 6 letters. [2020-07-29 01:28:49,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:49,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 26 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:49,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:49,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 13 states and 16 transitions. [2020-07-29 01:28:49,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:49,662 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:49,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2020-07-29 01:28:49,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:49,663 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2020-07-29 01:28:49,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2020-07-29 01:28:49,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-07-29 01:28:49,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:49,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 16 transitions. Second operand 10 states. [2020-07-29 01:28:49,664 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 16 transitions. Second operand 10 states. [2020-07-29 01:28:49,664 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 10 states. [2020-07-29 01:28:49,665 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:49,666 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:28:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:28:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:49,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:49,667 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 13 states and 16 transitions. [2020-07-29 01:28:49,667 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 13 states and 16 transitions. [2020-07-29 01:28:49,667 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:49,669 INFO L93 Difference]: Finished difference Result 13 states and 16 transitions. [2020-07-29 01:28:49,669 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2020-07-29 01:28:49,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:49,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:49,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:49,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-29 01:28:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2020-07-29 01:28:49,671 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2020-07-29 01:28:49,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:49,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:28:49,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:28:49,674 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. Second operand 3 states. [2020-07-29 01:28:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:49,693 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:28:49,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:28:49,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:49,700 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:49,700 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2020-07-29 01:28:49,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:49,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 14 transitions. [2020-07-29 01:28:49,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:49,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:49,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 14 transitions. [2020-07-29 01:28:49,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:49,702 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2020-07-29 01:28:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 14 transitions. [2020-07-29 01:28:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2020-07-29 01:28:49,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:49,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 01:28:49,704 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 01:28:49,704 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 11 states. [2020-07-29 01:28:49,704 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:49,705 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:28:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:28:49,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:49,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:49,706 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 01:28:49,706 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 12 states and 14 transitions. [2020-07-29 01:28:49,707 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:49,708 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2020-07-29 01:28:49,708 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2020-07-29 01:28:49,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:49,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:49,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:49,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:49,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:28:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2020-07-29 01:28:49,709 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:28:49,709 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2020-07-29 01:28:49,709 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:49,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:28:49,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:49,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:49,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:49,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1] [2020-07-29 01:28:49,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:28:49,711 INFO L794 eck$LassoCheckResult]: Stem: 288#ULTIMATE.startENTRY havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; 289#L18-2 assume !!(main_~y~0 >= 0); 290#L19 assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; 297#L19-2 main_~x~0 := 1 + main_~x~0; 298#L18-2 assume !!(main_~y~0 >= 0); 296#L19 [2020-07-29 01:28:49,711 INFO L796 eck$LassoCheckResult]: Loop: 296#L19 assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; 293#L19-2 main_~x~0 := 1 + main_~x~0; 294#L18-2 assume !!(main_~y~0 >= 0); 296#L19 [2020-07-29 01:28:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,711 INFO L82 PathProgramCache]: Analyzing trace with hash 29863612, now seen corresponding path program 2 times [2020-07-29 01:28:49,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:49,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177055988] [2020-07-29 01:28:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:49,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:49,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:49,721 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:49,722 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 44743, now seen corresponding path program 2 times [2020-07-29 01:28:49,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:49,723 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749499712] [2020-07-29 01:28:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:49,727 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:49,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:49,731 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:49,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 608649772, now seen corresponding path program 1 times [2020-07-29 01:28:49,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:49,732 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905706045] [2020-07-29 01:28:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,781 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#true} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~y~0 >= 0); {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,782 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,783 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} main_~x~0 := 1 + main_~x~0; {364#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:28:49,784 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~y~0 >= 0); {364#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:28:49,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#(<= ULTIMATE.start_main_~x~0 1)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {362#false} is VALID [2020-07-29 01:28:49,785 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#false} main_~x~0 := 1 + main_~x~0; {362#false} is VALID [2020-07-29 01:28:49,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#false} assume !!(main_~y~0 >= 0); {362#false} is VALID [2020-07-29 01:28:49,786 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 01:28:49,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905706045] [2020-07-29 01:28:49,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143368898] [2020-07-29 01:28:49,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-29 01:28:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:49,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:49,862 INFO L280 TraceCheckUtils]: 0: Hoare triple {361#true} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} assume !!(main_~y~0 >= 0); {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,863 INFO L280 TraceCheckUtils]: 2: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {363#(<= ULTIMATE.start_main_~x~0 0)} is VALID [2020-07-29 01:28:49,864 INFO L280 TraceCheckUtils]: 3: Hoare triple {363#(<= ULTIMATE.start_main_~x~0 0)} main_~x~0 := 1 + main_~x~0; {364#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:28:49,865 INFO L280 TraceCheckUtils]: 4: Hoare triple {364#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~y~0 >= 0); {364#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:28:49,866 INFO L280 TraceCheckUtils]: 5: Hoare triple {364#(<= ULTIMATE.start_main_~x~0 1)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {362#false} is VALID [2020-07-29 01:28:49,866 INFO L280 TraceCheckUtils]: 6: Hoare triple {362#false} main_~x~0 := 1 + main_~x~0; {362#false} is VALID [2020-07-29 01:28:49,866 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#false} assume !!(main_~y~0 >= 0); {362#false} is VALID [2020-07-29 01:28:49,867 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 01:28:49,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:28:49,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2020-07-29 01:28:49,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198566637] [2020-07-29 01:28:49,892 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:49,892 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:49,892 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:49,892 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:49,892 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:49,893 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:49,893 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:49,893 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:49,893 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration3_Loop [2020-07-29 01:28:49,893 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:49,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:49,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:49,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,061 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:50,061 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,073 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:50,073 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,129 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:50,129 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,215 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:50,217 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:50,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:50,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:50,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:50,218 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:50,218 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,218 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:50,218 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:50,218 INFO L133 ssoRankerPreferences]: Filename of dumped script: GopanReps-CAV2006-Fig1a.c_Iteration3_Loop [2020-07-29 01:28:50,218 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:50,219 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:50,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:50,354 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:50,354 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:50,359 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:50,359 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:50,359 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:50,359 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:50,360 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:50,361 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:50,361 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,363 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:50,365 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:50,366 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:50,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:50,369 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:50,369 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:50,369 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:50,400 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:50,403 INFO L393 LassoCheck]: Loop: "assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1;" "main_~x~0 := 1 + main_~x~0;" "assume !!(main_~y~0 >= 0);" [2020-07-29 01:28:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,428 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#unseeded} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {386#unseeded} is VALID [2020-07-29 01:28:50,429 INFO L280 TraceCheckUtils]: 1: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,430 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#unseeded} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {386#unseeded} is VALID [2020-07-29 01:28:50,430 INFO L280 TraceCheckUtils]: 3: Hoare triple {386#unseeded} main_~x~0 := 1 + main_~x~0; {386#unseeded} is VALID [2020-07-29 01:28:50,431 INFO L280 TraceCheckUtils]: 4: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,435 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,473 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {416#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,474 INFO L280 TraceCheckUtils]: 1: Hoare triple {416#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := 1 + main_~x~0; {416#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {416#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~y~0 >= 0); {399#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:50,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:50,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:50,482 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:50,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:50,494 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 13 transitions. Complement of second has 3 states. [2020-07-29 01:28:50,494 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 01:28:50,495 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:50,496 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:28:50,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:50,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,497 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,498 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:50,498 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:50,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:50,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:50,500 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:50,500 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 01:28:50,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,501 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 01:28:50,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,502 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 01:28:50,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,502 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 01:28:50,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,503 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 01:28:50,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,503 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 01:28:50,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,504 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 01:28:50,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,504 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 01:28:50,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,504 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 01:28:50,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,505 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 01:28:50,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,505 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 01:28:50,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,506 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 01:28:50,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,506 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 01:28:50,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,507 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 01:28:50,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,508 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 01:28:50,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,508 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 01:28:50,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,509 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 01:28:50,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,509 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 01:28:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,510 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 01:28:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,510 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 01:28:50,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,511 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 01:28:50,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,511 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 01:28:50,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,512 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:50,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,513 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:50,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#unseeded} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {386#unseeded} is VALID [2020-07-29 01:28:50,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,538 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#unseeded} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {386#unseeded} is VALID [2020-07-29 01:28:50,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {386#unseeded} main_~x~0 := 1 + main_~x~0; {386#unseeded} is VALID [2020-07-29 01:28:50,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,543 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,582 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {454#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,583 INFO L280 TraceCheckUtils]: 1: Hoare triple {454#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := 1 + main_~x~0; {454#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,584 INFO L280 TraceCheckUtils]: 2: Hoare triple {454#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~y~0 >= 0); {399#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:50,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:50,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:50,590 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:50,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,590 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:50,591 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:50,604 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 11 states and 13 transitions. Complement of second has 3 states. [2020-07-29 01:28:50,604 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 01:28:50,605 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:50,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2020-07-29 01:28:50,606 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:28:50,606 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,606 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,606 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,607 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:50,607 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:50,607 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states and 2 transitions. cyclomatic complexity: 1 [2020-07-29 01:28:50,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:50,608 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,608 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:50,609 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 01:28:50,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,609 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 01:28:50,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,609 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 01:28:50,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,610 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 01:28:50,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,611 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 01:28:50,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,612 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 01:28:50,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,612 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 01:28:50,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,613 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 01:28:50,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,613 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 01:28:50,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,614 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 01:28:50,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,615 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 01:28:50,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,616 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 01:28:50,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,616 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 01:28:50,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,617 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 01:28:50,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,617 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 01:28:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,618 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 01:28:50,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,619 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 01:28:50,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,619 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 01:28:50,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,620 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 01:28:50,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,621 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 01:28:50,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,621 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 01:28:50,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,622 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 01:28:50,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,622 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:50,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 2 transitions. [2020-07-29 01:28:50,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 2 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,623 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:50,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,645 INFO L280 TraceCheckUtils]: 0: Hoare triple {386#unseeded} havoc main_#res;havoc main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := 0;main_~y~0 := 0; {386#unseeded} is VALID [2020-07-29 01:28:50,646 INFO L280 TraceCheckUtils]: 1: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,646 INFO L280 TraceCheckUtils]: 2: Hoare triple {386#unseeded} assume main_~x~0 <= 50;main_~y~0 := 1 + main_~y~0; {386#unseeded} is VALID [2020-07-29 01:28:50,647 INFO L280 TraceCheckUtils]: 3: Hoare triple {386#unseeded} main_~x~0 := 1 + main_~x~0; {386#unseeded} is VALID [2020-07-29 01:28:50,647 INFO L280 TraceCheckUtils]: 4: Hoare triple {386#unseeded} assume !!(main_~y~0 >= 0); {386#unseeded} is VALID [2020-07-29 01:28:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,651 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:50,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:50,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !(main_~x~0 <= 50);main_~y~0 := main_~y~0 - 1; {492#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {492#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} main_~x~0 := 1 + main_~x~0; {492#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} is VALID [2020-07-29 01:28:50,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {492#(<= (+ ULTIMATE.start_main_~y~0 1) oldRank0)} assume !!(main_~y~0 >= 0); {399#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:50,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:50,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:50,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,696 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:50,697 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 3 states. [2020-07-29 01:28:50,734 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 3 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2020-07-29 01:28:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:50,734 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:50,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:50,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:50,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2020-07-29 01:28:50,737 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,737 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,737 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 13 transitions. cyclomatic complexity: 4 [2020-07-29 01:28:50,738 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2020-07-29 01:28:50,738 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:50,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:50,739 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:50,739 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:50,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:50,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,739 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:50,739 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 01:28:50,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,741 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 01:28:50,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:50,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:50,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:50,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:50,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:50,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,743 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 01:28:50,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 13 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:50,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,745 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 01:28:50,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:28:50,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,746 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 01:28:50,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:28:50,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,748 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 01:28:50,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,749 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 01:28:50,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:50,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 19 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:50,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,750 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:28:50,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:28:50,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:28:50,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:28:50,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:50,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 19 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:50,754 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,754 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2020-07-29 01:28:50,754 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:50,754 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:50,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:50,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:50,755 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:50,755 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:50,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:50,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:28:50,756 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 01:28:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:50,756 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:28:50,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:28:50,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:50,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:50,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:50,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:50,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:50,766 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:50,766 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:50,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:50,767 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:50,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:50,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:50 BoogieIcfgContainer [2020-07-29 01:28:50,774 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:50,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:50,775 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:50,775 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:50,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:46" (3/4) ... [2020-07-29 01:28:50,779 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:50,779 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:50,782 INFO L168 Benchmark]: Toolchain (without parser) took 4839.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 954.9 MB in the beginning and 999.5 MB in the end (delta: -44.7 MB). Peak memory consumption was 158.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:50,783 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:50,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 226.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:50,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:50,785 INFO L168 Benchmark]: Boogie Preprocessor took 78.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:50,786 INFO L168 Benchmark]: RCFGBuilder took 286.85 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:50,787 INFO L168 Benchmark]: BuchiAutomizer took 4199.28 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 999.5 MB in the end (delta: 111.5 MB). Peak memory consumption was 182.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:50,787 INFO L168 Benchmark]: Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 999.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:50,791 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 226.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.53 ms. Allocated memory is still 1.0 GB. Free memory is still 944.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 944.1 MB in the beginning and 1.1 GB in the end (delta: -184.5 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 286.85 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4199.28 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 999.5 MB in the end (delta: 111.5 MB). Peak memory consumption was 182.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.88 ms. Allocated memory is still 1.2 GB. Free memory is still 999.5 MB. 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 + 101 and consists of 5 locations. One deterministic module has affine ranking function y and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 3 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.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 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: 22 SDtfs, 27 SDslu, 13 SDs, 0 SdLazy, 31 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf97 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...