./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:14:49,688 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:14:49,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:14:49,704 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:14:49,705 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:14:49,706 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:14:49,708 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:14:49,710 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:14:49,712 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:14:49,713 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:14:49,714 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:14:49,714 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:14:49,716 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:14:49,717 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:14:49,719 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:14:49,720 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:14:49,720 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:14:49,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:14:49,726 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:14:49,727 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:14:49,729 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:14:49,731 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:14:49,734 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:14:49,734 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:14:49,735 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:14:49,736 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:14:49,737 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:14:49,738 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:14:49,739 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:14:49,740 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:14:49,741 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:14:49,742 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:14:49,742 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:14:49,742 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:14:49,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:14:49,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:14:49,745 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:14:49,767 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:14:49,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:14:49,769 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:14:49,769 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:14:49,769 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:14:49,770 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:14:49,770 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:14:49,770 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:14:49,771 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:14:49,771 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:14:49,771 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:14:49,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:14:49,771 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:14:49,771 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:14:49,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:14:49,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:14:49,772 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:14:49,772 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:14:49,772 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:14:49,773 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:14:49,773 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:14:49,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:14:49,773 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:14:49,773 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:14:49,773 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:14:49,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:14:49,776 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:14:49,776 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:14:49,778 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:14:49,778 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-11-28 23:14:49,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:14:49,851 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:14:49,859 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:14:49,860 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:14:49,862 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:14:49,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-28 23:14:49,943 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9affbbdb/5b3a8b4435eb4c24a41be0e1107161a7/FLAG4dc5c7703 [2018-11-28 23:14:50,428 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:14:50,429 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-28 23:14:50,437 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9affbbdb/5b3a8b4435eb4c24a41be0e1107161a7/FLAG4dc5c7703 [2018-11-28 23:14:50,773 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9affbbdb/5b3a8b4435eb4c24a41be0e1107161a7 [2018-11-28 23:14:50,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:14:50,779 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:14:50,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:50,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:14:50,784 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:14:50,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:50" (1/1) ... [2018-11-28 23:14:50,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a4a907d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:50, skipping insertion in model container [2018-11-28 23:14:50,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:14:50" (1/1) ... [2018-11-28 23:14:50,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:14:50,820 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:14:51,061 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:51,068 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:14:51,098 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:14:51,119 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:14:51,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51 WrapperNode [2018-11-28 23:14:51,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:14:51,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:51,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:14:51,121 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:14:51,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,142 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,175 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:14:51,175 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:14:51,176 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:14:51,176 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:14:51,190 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (1/1) ... [2018-11-28 23:14:51,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:14:51,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:14:51,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:14:51,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:14:51,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (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 [2018-11-28 23:14:51,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:14:51,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:14:51,706 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:14:51,706 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-28 23:14:51,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:51 BoogieIcfgContainer [2018-11-28 23:14:51,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:14:51,708 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:14:51,708 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:14:51,720 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:14:51,721 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:51,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:14:50" (1/3) ... [2018-11-28 23:14:51,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f08914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:51, skipping insertion in model container [2018-11-28 23:14:51,728 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:51,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:14:51" (2/3) ... [2018-11-28 23:14:51,729 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f08914b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:14:51, skipping insertion in model container [2018-11-28 23:14:51,729 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:14:51,729 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:51" (3/3) ... [2018-11-28 23:14:51,732 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-11-28 23:14:51,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:14:51,816 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:14:51,816 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:14:51,816 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:14:51,819 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:14:51,819 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:14:51,819 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:14:51,819 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:14:51,819 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:14:51,836 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:14:51,864 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:51,864 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:51,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:51,874 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:51,874 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:51,874 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:14:51,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-28 23:14:51,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:51,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:51,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:51,878 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-28 23:14:51,879 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:51,888 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 4#L21true assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 5#L23-2true [2018-11-28 23:14:51,888 INFO L796 eck$LassoCheckResult]: Loop: 5#L23-2true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 8#L25-2true assume !(main_~j~0 < main_~m~0); 7#L25-3true main_~i~0 := 1 + main_~i~0; 5#L23-2true [2018-11-28 23:14:51,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:51,895 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2018-11-28 23:14:51,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:51,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:51,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:51,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:51,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 42943, now seen corresponding path program 1 times [2018-11-28 23:14:52,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:52,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash 29684988, now seen corresponding path program 1 times [2018-11-28 23:14:52,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:52,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:52,173 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:52,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:52,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:52,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:52,175 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:52,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:52,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:52,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:52,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:52,176 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:52,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,495 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:52,497 INFO L412 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) [2018-11-28 23:14:52,508 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:52,508 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,565 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:52,565 INFO L448 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:14:52,575 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:52,575 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:52,630 INFO L448 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,637 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:52,638 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:52,683 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:52,812 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:52,815 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:52,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:52,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:52,815 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:52,815 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:52,815 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:52,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:52,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:52,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration1_Loop [2018-11-28 23:14:52,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:52,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:52,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:52,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:53,053 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:53,055 INFO L122 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 [2018-11-28 23:14:53,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,064 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:53,065 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:53,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:53,076 INFO L122 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 [2018-11-28 23:14:53,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,082 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:53,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:53,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:53,100 INFO L122 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 [2018-11-28 23:14:53,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:53,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:53,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:53,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:53,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:53,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:53,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:53,122 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:53,143 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:53,145 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:53,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:53,150 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:53,150 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:53,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:14:53,153 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:53,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:53,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:53,447 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 [2018-11-28 23:14:53,448 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-11-28 23:14:53,518 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 42 states and 62 transitions. Complement of second has 8 states. [2018-11-28 23:14:53,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2018-11-28 23:14:53,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 3 letters. [2018-11-28 23:14:53,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2018-11-28 23:14:53,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 2 letters. Loop has 6 letters. [2018-11-28 23:14:53,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:53,528 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 62 transitions. [2018-11-28 23:14:53,532 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:53,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 14 states and 21 transitions. [2018-11-28 23:14:53,538 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:14:53,538 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-11-28 23:14:53,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2018-11-28 23:14:53,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:53,539 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2018-11-28 23:14:53,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2018-11-28 23:14:53,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-11-28 23:14:53,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:14:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 20 transitions. [2018-11-28 23:14:53,567 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-28 23:14:53,567 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 20 transitions. [2018-11-28 23:14:53,567 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:14:53,567 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2018-11-28 23:14:53,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:53,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:53,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:53,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:14:53,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:53,569 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 98#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 99#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 104#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 96#L28-2 [2018-11-28 23:14:53,570 INFO L796 eck$LassoCheckResult]: Loop: 96#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 96#L28-2 [2018-11-28 23:14:53,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,570 INFO L82 PathProgramCache]: Analyzing trace with hash 957581, now seen corresponding path program 1 times [2018-11-28 23:14:53,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,590 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 1 times [2018-11-28 23:14:53,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:53,600 INFO L82 PathProgramCache]: Analyzing trace with hash 29685042, now seen corresponding path program 1 times [2018-11-28 23:14:53,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:53,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:53,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:53,652 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:53,652 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:53,652 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:53,652 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:53,653 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:53,653 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,653 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:53,653 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:53,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:53,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:53,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:53,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:53,805 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:53,805 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:14:53,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,831 INFO L448 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 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 [2018-11-28 23:14:53,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:53,856 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:53,856 INFO L448 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:53,867 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:53,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:53,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:54,036 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:54,038 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:54,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:54,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:54,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:54,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:54,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:54,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:54,041 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-28 23:14:54,041 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:54,041 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:54,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,342 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:14:54,557 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:54,557 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:54,558 INFO L122 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 [2018-11-28 23:14:54,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:54,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:54,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:54,570 INFO L122 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 [2018-11-28 23:14:54,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,576 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:54,576 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:54,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:54,583 INFO L122 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 [2018-11-28 23:14:54,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:54,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:54,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:54,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:54,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:54,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:54,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:54,593 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:54,597 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:54,598 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:54,598 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:54,598 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:54,599 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:54,599 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-28 23:14:54,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:54,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:54,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:54,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:54,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10 Second operand 2 states. [2018-11-28 23:14:54,710 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 20 transitions. cyclomatic complexity: 10. Second operand 2 states. Result 27 states and 43 transitions. Complement of second has 6 states. [2018-11-28 23:14:54,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:54,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:54,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2018-11-28 23:14:54,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 1 letters. [2018-11-28 23:14:54,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 5 letters. Loop has 1 letters. [2018-11-28 23:14:54,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:14:54,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:54,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 43 transitions. [2018-11-28 23:14:54,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:14:54,716 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 18 states and 27 transitions. [2018-11-28 23:14:54,717 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:14:54,717 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:14:54,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 27 transitions. [2018-11-28 23:14:54,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:54,717 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-28 23:14:54,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 27 transitions. [2018-11-28 23:14:54,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-28 23:14:54,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-28 23:14:54,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 27 transitions. [2018-11-28 23:14:54,721 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-28 23:14:54,721 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 27 transitions. [2018-11-28 23:14:54,721 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:14:54,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 27 transitions. [2018-11-28 23:14:54,722 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-11-28 23:14:54,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:54,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:54,723 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:14:54,723 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:54,723 INFO L794 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 181#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 182#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 180#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 188#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 175#L28-3 main_~i~0 := main_~k~0; 186#L25-2 [2018-11-28 23:14:54,723 INFO L796 eck$LassoCheckResult]: Loop: 186#L25-2 assume !(main_~j~0 < main_~m~0); 187#L25-3 main_~i~0 := 1 + main_~i~0; 189#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 186#L25-2 [2018-11-28 23:14:54,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash 920236275, now seen corresponding path program 1 times [2018-11-28 23:14:54,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:54,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,739 INFO L82 PathProgramCache]: Analyzing trace with hash 50233, now seen corresponding path program 2 times [2018-11-28 23:14:54,739 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:54,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:54,747 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 1 times [2018-11-28 23:14:54,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:54,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:54,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:54,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:54,823 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:54,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:54,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:54,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:54,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:54,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:54,824 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:54,824 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:54,824 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:54,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:54,824 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:54,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:54,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,080 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:55,080 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,084 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,084 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,106 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:55,106 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-11-28 23:14:55,113 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,113 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,117 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:55,117 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Honda state: {ULTIMATE.start_main_~j~0=0, ULTIMATE.start_main_~m~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,165 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:55,166 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:55,172 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,207 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:55,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:55,694 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:55,697 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:55,697 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:55,697 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:55,697 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:55,697 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:55,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:55,698 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:55,698 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:55,698 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-28 23:14:55,698 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:55,698 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:55,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:55,929 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:55,930 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:55,931 INFO L122 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 [2018-11-28 23:14:55,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:55,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:55,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:55,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:55,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:55,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:55,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:55,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:55,940 INFO L122 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 [2018-11-28 23:14:55,943 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:55,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:55,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:55,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:55,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:55,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:55,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:55,953 INFO L122 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 [2018-11-28 23:14:55,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:55,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:55,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:55,956 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:55,956 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:55,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:55,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:55,962 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:55,969 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:55,969 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:55,970 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:55,970 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:55,970 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:55,971 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:14:55,971 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:56,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,081 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 [2018-11-28 23:14:56,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13 Second operand 4 states. [2018-11-28 23:14:56,146 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 27 transitions. cyclomatic complexity: 13. Second operand 4 states. Result 31 states and 51 transitions. Complement of second has 8 states. [2018-11-28 23:14:56,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:56,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:56,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-28 23:14:56,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-28 23:14:56,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:14:56,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-28 23:14:56,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,150 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2018-11-28 23:14:56,152 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:56,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 22 states and 34 transitions. [2018-11-28 23:14:56,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:14:56,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:14:56,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2018-11-28 23:14:56,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:56,154 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2018-11-28 23:14:56,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2018-11-28 23:14:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:14:56,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:14:56,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions. [2018-11-28 23:14:56,157 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-28 23:14:56,157 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 31 transitions. [2018-11-28 23:14:56,157 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:14:56,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions. [2018-11-28 23:14:56,158 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:14:56,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:56,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:56,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:14:56,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1] [2018-11-28 23:14:56,159 INFO L794 eck$LassoCheckResult]: Stem: 283#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 277#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 278#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 288#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 287#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 276#L28-3 main_~i~0 := main_~k~0; 286#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 273#L28-2 [2018-11-28 23:14:56,159 INFO L796 eck$LassoCheckResult]: Loop: 273#L28-2 assume !!(main_~k~0 < main_~N~0 - 1);main_~k~0 := 1 + main_~k~0; 273#L28-2 [2018-11-28 23:14:56,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 2 times [2018-11-28 23:14:56,160 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:56,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:56,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash 62, now seen corresponding path program 2 times [2018-11-28 23:14:56,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:56,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:56,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,179 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:56,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:56,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash -416201988, now seen corresponding path program 1 times [2018-11-28 23:14:56,184 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:56,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:56,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:14:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:14:56,343 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:56,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:56,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:56,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:56,343 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:56,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,344 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:56,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:56,344 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:56,344 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:56,344 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:56,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,482 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:56,482 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:56,487 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:56,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:56,662 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:56,664 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:56,664 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:56,664 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:56,664 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:56,664 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:56,665 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:56,665 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:56,665 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:56,665 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration4_Loop [2018-11-28 23:14:56,666 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:56,666 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:56,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:56,807 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:56,807 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:56,808 INFO L122 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 [2018-11-28 23:14:56,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:56,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:56,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:56,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:56,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:56,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:56,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:56,814 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:56,820 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:56,820 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:56,821 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:56,821 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:56,821 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:56,822 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~N~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~N~0 Supporting invariants [] [2018-11-28 23:14:56,822 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:56,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,869 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:56,869 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-28 23:14:56,886 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-11-28 23:14:56,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:56,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:56,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-28 23:14:56,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 23:14:56,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,888 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:56,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,930 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:56,930 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-28 23:14:56,946 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 25 states and 38 transitions. Complement of second has 5 states. [2018-11-28 23:14:56,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:56,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-11-28 23:14:56,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 23:14:56,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:56,951 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:56,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:56,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:56,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:56,978 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:56,978 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16 Second operand 2 states. [2018-11-28 23:14:57,002 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 31 transitions. cyclomatic complexity: 16. Second operand 2 states. Result 36 states and 60 transitions. Complement of second has 5 states. [2018-11-28 23:14:57,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:57,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-28 23:14:57,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 29 transitions. [2018-11-28 23:14:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 1 letters. [2018-11-28 23:14:57,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 8 letters. Loop has 1 letters. [2018-11-28 23:14:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 29 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:14:57,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 60 transitions. [2018-11-28 23:14:57,009 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:14:57,012 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 22 states and 33 transitions. [2018-11-28 23:14:57,012 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-28 23:14:57,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:14:57,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 33 transitions. [2018-11-28 23:14:57,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:57,012 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 33 transitions. [2018-11-28 23:14:57,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 33 transitions. [2018-11-28 23:14:57,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2018-11-28 23:14:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-28 23:14:57,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 29 transitions. [2018-11-28 23:14:57,016 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 29 transitions. [2018-11-28 23:14:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:14:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:14:57,022 INFO L87 Difference]: Start difference. First operand 20 states and 29 transitions. Second operand 4 states. [2018-11-28 23:14:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:57,087 INFO L93 Difference]: Finished difference Result 19 states and 26 transitions. [2018-11-28 23:14:57,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:14:57,088 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 26 transitions. [2018-11-28 23:14:57,090 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:57,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 26 transitions. [2018-11-28 23:14:57,092 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-28 23:14:57,092 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-28 23:14:57,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2018-11-28 23:14:57,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:57,092 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:14:57,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2018-11-28 23:14:57,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-28 23:14:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-28 23:14:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-11-28 23:14:57,095 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:14:57,095 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-11-28 23:14:57,095 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:14:57,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2018-11-28 23:14:57,096 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:57,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:57,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:57,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-28 23:14:57,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:57,097 INFO L794 eck$LassoCheckResult]: Stem: 535#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 533#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 534#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 540#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 539#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 528#L28-3 main_~i~0 := main_~k~0; 538#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-11-28 23:14:57,097 INFO L796 eck$LassoCheckResult]: Loop: 525#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 526#L28-3 main_~i~0 := main_~k~0; 530#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 525#L28-2 [2018-11-28 23:14:57,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446525, now seen corresponding path program 3 times [2018-11-28 23:14:57,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:57,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,112 INFO L82 PathProgramCache]: Analyzing trace with hash 58767, now seen corresponding path program 1 times [2018-11-28 23:14:57,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:57,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -538152755, now seen corresponding path program 4 times [2018-11-28 23:14:57,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,120 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:57,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,226 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:57,226 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:57,226 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:57,226 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:57,226 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:57,226 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,227 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:57,227 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:57,227 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:14:57,227 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:57,227 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:57,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,362 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:57,363 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,368 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:57,374 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Honda state: {ULTIMATE.start_main_~k~0=1, ULTIMATE.start_main_~i~0=1, ULTIMATE.start_main_~N~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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 [2018-11-28 23:14:57,395 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,396 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,426 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:57,426 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_9=0} Honda state: {v_rep~unnamed0~0~false_9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:57,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_9=1} Honda state: {v_rep~unnamed0~0~true_9=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-11-28 23:14:57,460 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:57,460 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:57,491 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:57,624 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:57,627 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:57,627 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:57,627 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:57,628 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:57,628 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:57,628 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:57,628 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:57,628 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:57,628 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-28 23:14:57,628 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:57,629 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:57,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:57,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:57,754 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:57,755 INFO L122 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 [2018-11-28 23:14:57,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,758 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:57,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:57,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:57,762 INFO L122 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 [2018-11-28 23:14:57,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:57,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:57,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:57,769 INFO L122 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 [2018-11-28 23:14:57,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:57,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:57,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:57,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:57,780 INFO L122 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 [2018-11-28 23:14:57,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:57,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:57,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:57,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:57,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:57,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:57,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:57,784 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:57,788 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:57,788 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:57,789 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:57,789 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:57,789 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:57,789 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:14:57,790 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:57,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:57,885 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:57,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:57,886 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-11-28 23:14:57,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2018-11-28 23:14:57,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 37 states and 48 transitions. Complement of second has 5 states. [2018-11-28 23:14:57,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:57,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:14:57,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 14 transitions. [2018-11-28 23:14:57,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:14:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:14:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 14 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:14:57,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:57,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 48 transitions. [2018-11-28 23:14:57,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:57,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 33 states and 44 transitions. [2018-11-28 23:14:57,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:14:57,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:14:57,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2018-11-28 23:14:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:57,916 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-28 23:14:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2018-11-28 23:14:57,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2018-11-28 23:14:57,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:14:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-11-28 23:14:57,919 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-11-28 23:14:57,919 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-11-28 23:14:57,919 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:14:57,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 35 transitions. [2018-11-28 23:14:57,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:57,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:57,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:57,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2018-11-28 23:14:57,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:14:57,921 INFO L794 eck$LassoCheckResult]: Stem: 640#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 635#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 636#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 637#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 651#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 647#L28-3 main_~i~0 := main_~k~0; 648#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 649#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 650#L28-3 main_~i~0 := main_~k~0; 655#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-11-28 23:14:57,921 INFO L796 eck$LassoCheckResult]: Loop: 641#L25-3 main_~i~0 := 1 + main_~i~0; 642#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 653#L25-2 assume !(main_~j~0 < main_~m~0); 641#L25-3 [2018-11-28 23:14:57,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -538152757, now seen corresponding path program 1 times [2018-11-28 23:14:57,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:57,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 67693, now seen corresponding path program 3 times [2018-11-28 23:14:57,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:57,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:57,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1004170083, now seen corresponding path program 2 times [2018-11-28 23:14:57,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:57,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:57,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:14:58,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:14:58,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:14:58,015 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:14:58,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:14:58,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:14:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:58,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 23:14:58,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:14:58,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-28 23:14:58,118 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:58,118 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:58,119 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:58,119 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:58,119 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:58,119 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,119 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:58,119 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:58,120 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:14:58,120 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:58,120 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:58,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,212 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:58,212 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2018-11-28 23:14:58,218 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:58,218 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:58,239 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:58,239 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,244 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:58,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:58,265 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:58,265 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:58,270 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:58,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:58,652 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:58,654 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:58,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:58,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:58,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:58,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:58,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:58,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:58,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:58,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-28 23:14:58,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:58,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:58,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:58,724 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:58,725 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:58,725 INFO L122 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 [2018-11-28 23:14:58,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:58,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:58,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:58,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:58,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:58,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:58,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:58,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:58,729 INFO L122 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 [2018-11-28 23:14:58,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:58,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:58,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:58,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:58,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:58,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:58,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:58,734 INFO L122 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 [2018-11-28 23:14:58,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:58,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:58,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:58,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:58,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:58,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:58,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:58,738 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:58,741 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:14:58,741 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:58,741 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:58,742 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:58,742 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:58,742 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:14:58,743 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:58,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:58,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:58,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:14:58,996 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:14:58,996 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-28 23:14:59,057 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 35 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 65 states and 90 transitions. Complement of second has 7 states. [2018-11-28 23:14:59,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:14:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:14:59,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:14:59,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:59,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 23:14:59,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:59,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:14:59,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:59,063 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 90 transitions. [2018-11-28 23:14:59,065 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:14:59,066 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 50 states and 68 transitions. [2018-11-28 23:14:59,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-28 23:14:59,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-28 23:14:59,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 68 transitions. [2018-11-28 23:14:59,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:59,069 INFO L705 BuchiCegarLoop]: Abstraction has 50 states and 68 transitions. [2018-11-28 23:14:59,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 68 transitions. [2018-11-28 23:14:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2018-11-28 23:14:59,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 23:14:59,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2018-11-28 23:14:59,076 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 49 transitions. [2018-11-28 23:14:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:14:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:14:59,077 INFO L87 Difference]: Start difference. First operand 34 states and 49 transitions. Second operand 6 states. [2018-11-28 23:14:59,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:14:59,153 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2018-11-28 23:14:59,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:14:59,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 49 transitions. [2018-11-28 23:14:59,156 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:14:59,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 49 transitions. [2018-11-28 23:14:59,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:14:59,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:14:59,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2018-11-28 23:14:59,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:59,161 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-11-28 23:14:59,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2018-11-28 23:14:59,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2018-11-28 23:14:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-28 23:14:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions. [2018-11-28 23:14:59,164 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-28 23:14:59,164 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 35 transitions. [2018-11-28 23:14:59,164 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:14:59,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions. [2018-11-28 23:14:59,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:14:59,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:59,171 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:59,171 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:14:59,171 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:14:59,172 INFO L794 eck$LassoCheckResult]: Stem: 909#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 907#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 908#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 916#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 917#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 901#L28-3 main_~i~0 := main_~k~0; 912#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-11-28 23:14:59,172 INFO L796 eck$LassoCheckResult]: Loop: 910#L25-3 main_~i~0 := 1 + main_~i~0; 902#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 903#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 898#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 899#L28-3 main_~i~0 := main_~k~0; 920#L25-2 assume !(main_~j~0 < main_~m~0); 910#L25-3 [2018-11-28 23:14:59,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1537446527, now seen corresponding path program 2 times [2018-11-28 23:14:59,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:59,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:59,195 INFO L82 PathProgramCache]: Analyzing trace with hash 2016730719, now seen corresponding path program 1 times [2018-11-28 23:14:59,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:59,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:59,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:59,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:59,207 INFO L82 PathProgramCache]: Analyzing trace with hash -504812577, now seen corresponding path program 3 times [2018-11-28 23:14:59,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:14:59,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:59,314 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:59,314 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:59,315 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:59,315 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:59,315 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:59,315 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:59,315 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:59,315 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:59,318 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:14:59,318 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:59,318 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:59,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:59,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:59,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:59,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:59,462 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:59,462 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:59,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:59,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:59,471 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:14:59,471 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Honda state: {ULTIMATE.start_main_~j~0=1, ULTIMATE.start_main_~m~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:59,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:59,492 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:59,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:59,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:11,546 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-28 23:15:11,549 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:11,549 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:11,549 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:11,549 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:11,549 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:11,549 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:11,549 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:11,550 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:11,550 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-28 23:15:11,550 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:11,550 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:11,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:11,647 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:11,648 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:11,648 INFO L122 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 [2018-11-28 23:15:11,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:11,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:11,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:11,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:11,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:11,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:11,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:11,655 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:11,657 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:15:11,658 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:11,658 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:11,658 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:11,658 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:11,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:15:11,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:11,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:11,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:12,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:12,068 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:15:12,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-28 23:15:12,111 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 49 states and 69 transitions. Complement of second has 7 states. [2018-11-28 23:15:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:15:12,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:15:12,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:15:12,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,113 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:12,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:12,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:12,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:12,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-28 23:15:12,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17 Second operand 6 states. [2018-11-28 23:15:12,317 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 35 transitions. cyclomatic complexity: 17. Second operand 6 states. Result 56 states and 79 transitions. Complement of second has 10 states. [2018-11-28 23:15:12,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:12,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-28 23:15:12,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-11-28 23:15:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:15:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 6 letters. [2018-11-28 23:15:12,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 7 letters. Loop has 12 letters. [2018-11-28 23:15:12,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:12,322 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 79 transitions. [2018-11-28 23:15:12,324 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:12,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 43 states and 60 transitions. [2018-11-28 23:15:12,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:15:12,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-28 23:15:12,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 60 transitions. [2018-11-28 23:15:12,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:15:12,326 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 60 transitions. [2018-11-28 23:15:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 60 transitions. [2018-11-28 23:15:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2018-11-28 23:15:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 23:15:12,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2018-11-28 23:15:12,334 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-28 23:15:12,334 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 52 transitions. [2018-11-28 23:15:12,334 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:15:12,335 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 52 transitions. [2018-11-28 23:15:12,335 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:15:12,335 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:15:12,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:15:12,336 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:15:12,336 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:15:12,336 INFO L794 eck$LassoCheckResult]: Stem: 1160#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_~i~0, main_~j~0, main_~k~0, main_~m~0, main_~n~0, main_~N~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~m~0;havoc main_~n~0;havoc main_~N~0;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~k~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~n~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~m~0 := main_#t~nondet4;havoc main_#t~nondet4;main_~N~0 := main_#t~nondet5;havoc main_#t~nondet5; 1158#L21 assume (0 <= main_~n~0 && 0 <= main_~m~0) && 0 <= main_~N~0;main_~i~0 := 0; 1159#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1174#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1171#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1168#L28-3 main_~i~0 := main_~k~0; 1167#L25-2 assume !(main_~j~0 < main_~m~0); 1161#L25-3 main_~i~0 := 1 + main_~i~0; 1154#L23-2 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 0; 1155#L25-2 [2018-11-28 23:15:12,337 INFO L796 eck$LassoCheckResult]: Loop: 1155#L25-2 assume !!(main_~j~0 < main_~m~0);main_~j~0 := 1 + main_~j~0;main_~k~0 := main_~i~0; 1150#L28-2 assume !(main_~k~0 < main_~N~0 - 1); 1151#L28-3 main_~i~0 := main_~k~0; 1155#L25-2 [2018-11-28 23:15:12,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,337 INFO L82 PathProgramCache]: Analyzing trace with hash -17361401, now seen corresponding path program 4 times [2018-11-28 23:15:12,337 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,348 INFO L82 PathProgramCache]: Analyzing trace with hash 51867, now seen corresponding path program 2 times [2018-11-28 23:15:12,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:12,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1817399595, now seen corresponding path program 5 times [2018-11-28 23:15:12,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:15:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:15:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,355 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:15:12,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:15:12,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:15:12,405 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:12,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:12,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:12,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:12,406 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:15:12,406 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,406 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:12,406 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:12,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:15:12,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:12,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:12,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:12,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:12,499 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:12,520 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:12,520 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,525 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:12,525 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:12,544 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:12,545 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_15=0} Honda state: {v_rep~unnamed0~0~false_15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:12,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:12,557 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:15:12,557 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Honda state: {ULTIMATE.start_main_~k~0=-7, ULTIMATE.start_main_~i~0=-7, ULTIMATE.start_main_~N~0=-6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,578 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:15:12,578 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:15:12,600 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:15:12,742 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:15:12,744 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:15:12,744 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:15:12,744 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:15:12,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:15:12,744 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:15:12,745 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:15:12,745 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:15:12,745 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:15:12,745 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c_Iteration8_Loop [2018-11-28 23:15:12,745 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:15:12,745 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:15:12,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:12,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:15:13,236 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:15:13,236 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:15:13,237 INFO L122 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 [2018-11-28 23:15:13,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:15:13,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:15:13,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:13,242 INFO L122 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 [2018-11-28 23:15:13,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:13,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:13,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:13,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:15:13,245 INFO L122 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 [2018-11-28 23:15:13,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:15:13,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:15:13,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:15:13,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:15:13,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:15:13,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:15:13,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:15:13,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:15:13,249 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:15:13,250 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:15:13,250 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:15:13,250 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:15:13,250 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:15:13,250 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:15:13,250 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:15:13,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:13,397 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 [2018-11-28 23:15:13,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-28 23:15:13,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 55 states and 81 transitions. Complement of second has 5 states. [2018-11-28 23:15:13,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2018-11-28 23:15:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:15:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,411 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:13,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:13,450 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 [2018-11-28 23:15:13,450 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-28 23:15:13,467 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 51 states and 75 transitions. Complement of second has 7 states. [2018-11-28 23:15:13,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:13,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:15:13,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:15:13,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:15:13,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:15:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:15:13,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:15:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:15:13,509 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 [2018-11-28 23:15:13,509 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26 Second operand 3 states. [2018-11-28 23:15:13,519 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 52 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 69 states and 104 transitions. Complement of second has 4 states. [2018-11-28 23:15:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:15:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:15:13,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 20 transitions. [2018-11-28 23:15:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-28 23:15:13,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-28 23:15:13,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 20 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-28 23:15:13,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:15:13,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 104 transitions. [2018-11-28 23:15:13,526 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:13,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-11-28 23:15:13,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:15:13,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:15:13,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:15:13,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:15:13,527 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:13,527 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:13,527 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:15:13,527 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:15:13,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:15:13,531 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:15:13,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:15:13,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:15:13 BoogieIcfgContainer [2018-11-28 23:15:13,540 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:15:13,540 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:15:13,540 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:15:13,540 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:15:13,542 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:14:51" (3/4) ... [2018-11-28 23:15:13,548 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:15:13,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:15:13,550 INFO L168 Benchmark]: Toolchain (without parser) took 22772.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 952.7 MB in the beginning and 858.1 MB in the end (delta: 94.6 MB). Peak memory consumption was 258.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:13,553 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:13,553 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:13,554 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.74 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:13,555 INFO L168 Benchmark]: Boogie Preprocessor took 38.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:13,555 INFO L168 Benchmark]: RCFGBuilder took 492.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.6 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -102.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:13,560 INFO L168 Benchmark]: BuchiAutomizer took 21831.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.5 MB). Free memory was 1.0 GB in the beginning and 858.1 MB in the end (delta: 185.1 MB). Peak memory consumption was 282.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:15:13,563 INFO L168 Benchmark]: Witness Printer took 8.88 ms. Allocated memory is still 1.2 GB. Free memory is still 858.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:15:13,572 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 340.32 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 940.6 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.74 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.91 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 492.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 66.6 MB). Free memory was 940.6 MB in the beginning and 1.0 GB in the end (delta: -102.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21831.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 97.5 MB). Free memory was 1.0 GB in the beginning and 858.1 MB in the end (delta: 185.1 MB). Peak memory consumption was 282.6 MB. Max. memory is 11.5 GB. * Witness Printer took 8.88 ms. Allocated memory is still 1.2 GB. Free memory is still 858.1 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 10 terminating modules (2 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + n and consists of 5 locations. One deterministic module has affine ranking function m + -1 * j and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function n + -1 * i and consists of 6 locations. One nondeterministic module has affine ranking function -1 * k + N and consists of 4 locations. One nondeterministic module has affine ranking function m + -1 * j and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 21.7s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 19.2s. Construction of modules took 0.2s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 49 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/1 HoareTripleCheckerStatistics: 163 SDtfs, 160 SDslu, 63 SDs, 0 SdLazy, 133 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT6 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax169 hnf97 lsp41 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq156 hnf93 smp100 dnf100 smp100 tf111 neg100 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 16 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 14.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...