./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/loop-invgen/nested6_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 934ee9c856a834ce808d29dea79c6912619f897f ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:44:02,857 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:44:02,859 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:44:02,872 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:44:02,873 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:44:02,874 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:44:02,876 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:44:02,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:44:02,879 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:44:02,880 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:44:02,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:44:02,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:44:02,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:44:02,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:44:02,885 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:44:02,886 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:44:02,887 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:44:02,889 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:44:02,892 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:44:02,893 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:44:02,895 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:44:02,896 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:44:02,899 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:44:02,899 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:44:02,900 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:44:02,901 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:44:02,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:44:02,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:44:02,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:44:02,905 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:44:02,906 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:44:02,906 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:44:02,907 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:44:02,907 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:44:02,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:44:02,909 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:44:02,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:44:02,929 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:44:02,929 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:44:02,931 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:44:02,931 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:44:02,931 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:44:02,931 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:44:02,931 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:44:02,932 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:44:02,932 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:44:02,933 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:44:02,933 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:44:02,933 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:44:02,933 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:44:02,933 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:44:02,933 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:44:02,934 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:44:02,934 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:44:02,935 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:44:02,936 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:44:02,936 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:44:02,936 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:44:02,936 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:44:02,936 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:44:02,938 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:44:02,938 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:44:02,938 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:44:02,939 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:44:02,940 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 934ee9c856a834ce808d29dea79c6912619f897f [2018-11-28 23:44:02,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:44:02,997 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:44:03,005 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:44:03,007 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:44:03,008 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:44:03,009 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-28 23:44:03,082 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39bb296/2697568e2c084930bd3e353a6b05dd06/FLAG9c7c7a3e3 [2018-11-28 23:44:03,561 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:44:03,561 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2018-11-28 23:44:03,568 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39bb296/2697568e2c084930bd3e353a6b05dd06/FLAG9c7c7a3e3 [2018-11-28 23:44:03,913 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa39bb296/2697568e2c084930bd3e353a6b05dd06 [2018-11-28 23:44:03,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:44:03,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:44:03,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:03,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:44:03,923 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:44:03,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:03" (1/1) ... [2018-11-28 23:44:03,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ec8fb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:03, skipping insertion in model container [2018-11-28 23:44:03,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:03" (1/1) ... [2018-11-28 23:44:03,936 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:44:03,959 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:44:04,161 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:04,167 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:44:04,194 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:04,213 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:44:04,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04 WrapperNode [2018-11-28 23:44:04,214 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:04,215 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:04,215 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:44:04,216 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:44:04,228 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:44:04" (1/1) ... [2018-11-28 23:44:04,235 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:44:04" (1/1) ... [2018-11-28 23:44:04,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:04,267 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:44:04,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:44:04,267 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:44:04,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (1/1) ... [2018-11-28 23:44:04,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:44:04,302 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:44:04,302 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:44:04,302 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:44:04,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (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:44:04,483 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:44:04,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:44:04,888 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:44:04,888 INFO L280 CfgBuilder]: Removed 13 assue(true) statements. [2018-11-28 23:44:04,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:04 BoogieIcfgContainer [2018-11-28 23:44:04,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:44:04,890 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:44:04,890 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:44:04,893 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:44:04,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:04,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:44:03" (1/3) ... [2018-11-28 23:44:04,895 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11a77a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:04, skipping insertion in model container [2018-11-28 23:44:04,895 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:04,895 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:04" (2/3) ... [2018-11-28 23:44:04,896 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11a77a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:04, skipping insertion in model container [2018-11-28 23:44:04,896 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:04,896 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:04" (3/3) ... [2018-11-28 23:44:04,898 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2018-11-28 23:44:04,961 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:44:04,962 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:44:04,962 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:44:04,962 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:44:04,963 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:44:04,963 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:44:04,963 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:44:04,963 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:44:04,963 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:44:04,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 23:44:05,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 23:44:05,007 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:05,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:05,015 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:44:05,016 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:05,016 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:44:05,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-28 23:44:05,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-11-28 23:44:05,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:05,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:05,020 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:44:05,020 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:05,030 INFO L794 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 21#L14true assume !!(main_~n~0 < 1000000); 3#L15true assume main_~k~0 == main_~n~0; 22#L15-1true main_~i~0 := 0; 5#L19-3true [2018-11-28 23:44:05,030 INFO L796 eck$LassoCheckResult]: Loop: 5#L19-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 8#L20-2true assume !(main_~j~0 < main_~n~0); 6#L19-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 5#L19-3true [2018-11-28 23:44:05,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:05,038 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2018-11-28 23:44:05,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:05,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:05,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:05,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:05,144 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2018-11-28 23:44:05,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:05,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:05,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:05,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:05,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2018-11-28 23:44:05,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:05,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:05,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:05,236 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:44:05,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:05,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:44:05,327 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:05,328 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:05,328 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:05,328 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:05,329 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:05,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:05,329 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:05,329 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:05,329 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2018-11-28 23:44:05,329 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:05,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:05,352 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:44:05,394 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:44:05,570 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:05,571 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:05,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:05,576 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:05,603 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:05,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:05,807 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:05,809 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:05,809 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:05,809 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:05,809 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:05,809 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:05,809 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:05,810 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:05,810 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:05,810 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2018-11-28 23:44:05,810 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:05,810 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:05,812 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:44:05,897 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:44:06,045 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:44:06,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:06,144 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:06,146 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:44:06,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:06,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:06,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:06,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:06,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:06,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:06,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:06,164 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:06,179 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:06,179 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:06,183 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:06,183 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:06,184 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:06,186 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:44:06,187 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:06,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:06,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:06,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:06,298 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:44:06,313 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:44:06,315 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2018-11-28 23:44:06,449 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 3 states. Result 63 states and 90 transitions. Complement of second has 7 states. [2018-11-28 23:44:06,450 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:44:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:06,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2018-11-28 23:44:06,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:44:06,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:06,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:44:06,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:06,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:44:06,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:06,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2018-11-28 23:44:06,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:44:06,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2018-11-28 23:44:06,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:44:06,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:44:06,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2018-11-28 23:44:06,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:06,476 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:44:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2018-11-28 23:44:06,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-28 23:44:06,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-28 23:44:06,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-28 23:44:06,505 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-28 23:44:06,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:44:06,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:44:06,509 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2018-11-28 23:44:06,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:06,612 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2018-11-28 23:44:06,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:44:06,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2018-11-28 23:44:06,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2018-11-28 23:44:06,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2018-11-28 23:44:06,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:44:06,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 23:44:06,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-11-28 23:44:06,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:06,618 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-11-28 23:44:06,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-11-28 23:44:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2018-11-28 23:44:06,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:44:06,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-28 23:44:06,622 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:44:06,622 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:44:06,622 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:44:06,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-28 23:44:06,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:44:06,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:06,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:06,624 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:44:06,624 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:44:06,625 INFO L794 eck$LassoCheckResult]: Stem: 230#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 231#L14 assume !!(main_~n~0 < 1000000); 208#L15 assume main_~k~0 == main_~n~0; 209#L15-1 main_~i~0 := 0; 210#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 212#L20-2 [2018-11-28 23:44:06,625 INFO L796 eck$LassoCheckResult]: Loop: 212#L20-2 assume !!(main_~j~0 < main_~n~0); 218#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 222#L22-2 assume !(main_~k~0 < main_~n~0); 216#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 212#L20-2 [2018-11-28 23:44:06,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2018-11-28 23:44:06,625 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:06,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2018-11-28 23:44:06,636 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:06,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:06,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:06,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:06,687 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:44:06,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:06,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:44:06,688 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:44:06,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:44:06,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:44:06,689 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-28 23:44:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:06,798 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2018-11-28 23:44:06,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:44:06,800 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2018-11-28 23:44:06,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:44:06,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2018-11-28 23:44:06,803 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:44:06,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:44:06,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2018-11-28 23:44:06,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:06,804 INFO L705 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 23:44:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2018-11-28 23:44:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-28 23:44:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-28 23:44:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-11-28 23:44:06,807 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 23:44:06,807 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-11-28 23:44:06,807 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:44:06,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2018-11-28 23:44:06,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:44:06,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:06,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:06,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-28 23:44:06,809 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:44:06,809 INFO L794 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 294#L14 assume !!(main_~n~0 < 1000000); 271#L15 assume main_~k~0 == main_~n~0; 272#L15-1 main_~i~0 := 0; 273#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 275#L20-2 [2018-11-28 23:44:06,810 INFO L796 eck$LassoCheckResult]: Loop: 275#L20-2 assume !!(main_~j~0 < main_~n~0); 281#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 291#L4-3 assume !(0 == __VERIFIER_assert_~cond); 289#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 283#L4-6 assume !(0 == __VERIFIER_assert_~cond); 279#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 275#L20-2 [2018-11-28 23:44:06,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,810 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2018-11-28 23:44:06,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:06,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:06,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:06,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2018-11-28 23:44:06,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:06,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:06,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:06,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2018-11-28 23:44:06,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:06,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:06,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:06,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:06,990 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:44:07,342 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2018-11-28 23:44:07,354 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:07,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:07,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:07,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:07,355 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:07,356 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:07,356 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:07,356 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:07,356 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:07,356 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:07,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:07,363 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:44:07,414 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:44:07,425 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:44:07,429 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:44:07,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:07,565 INFO L412 LassoAnalysis]: Checking for nontermination... 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:44:07,572 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:07,573 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:44:07,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:07,599 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:07,918 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:07,921 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:07,922 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:07,922 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:07,922 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:07,922 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:07,922 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:07,922 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:07,922 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:07,923 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:07,923 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:07,923 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:07,925 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:44:07,944 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:44:07,948 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:44:07,955 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:44:08,079 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:08,079 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:08,080 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:44:08,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:08,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:08,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:08,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:08,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:08,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:08,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:08,090 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:08,103 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:08,103 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:08,113 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:08,113 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:08,113 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:08,113 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:44:08,114 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:08,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:08,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:08,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:08,230 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:44:08,231 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:44:08,231 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2018-11-28 23:44:08,320 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 71 states and 90 transitions. Complement of second has 7 states. [2018-11-28 23:44:08,322 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:44:08,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:08,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:08,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-28 23:44:08,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:44:08,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-28 23:44:08,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,324 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2018-11-28 23:44:08,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 23:44:08,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2018-11-28 23:44:08,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:44:08,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:44:08,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2018-11-28 23:44:08,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:08,329 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2018-11-28 23:44:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2018-11-28 23:44:08,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2018-11-28 23:44:08,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 23:44:08,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2018-11-28 23:44:08,333 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-28 23:44:08,333 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2018-11-28 23:44:08,333 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:44:08,333 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2018-11-28 23:44:08,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-28 23:44:08,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:08,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:08,335 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:08,335 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:08,335 INFO L794 eck$LassoCheckResult]: Stem: 450#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 451#L14 assume !!(main_~n~0 < 1000000); 427#L15 assume main_~k~0 == main_~n~0; 428#L15-1 main_~i~0 := 0; 429#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 431#L20-2 assume !!(main_~j~0 < main_~n~0); 439#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 443#L22-2 [2018-11-28 23:44:08,335 INFO L796 eck$LassoCheckResult]: Loop: 443#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 444#L4 assume !(0 == __VERIFIER_assert_~cond); 453#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 443#L22-2 [2018-11-28 23:44:08,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2018-11-28 23:44:08,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:08,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,348 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2018-11-28 23:44:08,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:08,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:08,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2018-11-28 23:44:08,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:08,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:08,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:08,422 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:08,422 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:08,422 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:08,422 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:08,422 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:08,422 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:08,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:08,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:08,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 23:44:08,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:08,423 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:08,425 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:44:08,438 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:44:08,590 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:08,590 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:44:08,595 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:08,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:08,601 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:08,601 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=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:44:08,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:08,623 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:44:08,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:08,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:09,015 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:09,018 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:09,018 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:09,018 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:09,018 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:09,018 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:09,019 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:09,019 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:09,019 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:09,019 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 23:44:09,019 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:09,019 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:09,021 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:44:09,025 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:44:09,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:09,179 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:09,180 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:44:09,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:09,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:09,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:09,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:09,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:09,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:09,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:09,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:09,185 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:44:09,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:09,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:09,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:09,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:09,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:09,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:09,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:09,196 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:09,205 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:09,206 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:09,206 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:09,206 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:09,206 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:09,206 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:44:09,207 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:09,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:09,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:09,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:09,421 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:44:09,421 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:44:09,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2018-11-28 23:44:09,545 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15. Second operand 3 states. Result 132 states and 167 transitions. Complement of second has 7 states. [2018-11-28 23:44:09,547 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:44:09,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:09,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:44:09,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:44:09,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:09,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:44:09,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:09,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:44:09,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:09,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2018-11-28 23:44:09,553 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2018-11-28 23:44:09,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2018-11-28 23:44:09,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-28 23:44:09,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-28 23:44:09,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2018-11-28 23:44:09,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:09,558 INFO L705 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2018-11-28 23:44:09,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2018-11-28 23:44:09,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2018-11-28 23:44:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 23:44:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2018-11-28 23:44:09,566 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-28 23:44:09,566 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2018-11-28 23:44:09,566 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:44:09,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2018-11-28 23:44:09,567 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2018-11-28 23:44:09,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:09,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:09,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:09,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:44:09,569 INFO L794 eck$LassoCheckResult]: Stem: 682#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 683#L14 assume !!(main_~n~0 < 1000000); 656#L15 assume main_~k~0 == main_~n~0; 657#L15-1 main_~i~0 := 0; 658#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 659#L20-2 assume !!(main_~j~0 < main_~n~0); 703#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 708#L4-3 assume !(0 == __VERIFIER_assert_~cond); 707#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 706#L4-6 assume !(0 == __VERIFIER_assert_~cond); 705#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 699#L20-2 assume !(main_~j~0 < main_~n~0); 701#L19-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 698#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 697#L20-2 [2018-11-28 23:44:09,569 INFO L796 eck$LassoCheckResult]: Loop: 697#L20-2 assume !!(main_~j~0 < main_~n~0); 693#L21 assume !(0 != main_#t~nondet5);havoc main_#t~nondet5;__VERIFIER_assert_#in~cond := (if main_~k~0 >= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 694#L4-3 assume !(0 == __VERIFIER_assert_~cond); 704#L4-5 __VERIFIER_assert_#in~cond := (if main_~k~0 <= main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 702#L4-6 assume !(0 == __VERIFIER_assert_~cond); 700#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 697#L20-2 [2018-11-28 23:44:09,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2018-11-28 23:44:09,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:09,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:09,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:09,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:09,681 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:09,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:09,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:09,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:09,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 23:44:09,852 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:44:09,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2018-11-28 23:44:09,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:09,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:09,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:10,029 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:10,029 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:10,029 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:10,029 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:10,030 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:10,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:10,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:10,030 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:10,030 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 23:44:10,030 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:10,030 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:10,034 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:44:10,069 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:44:10,071 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:44:10,075 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:44:10,440 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-11-28 23:44:10,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:10,441 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:44:10,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:10,445 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2018-11-28 23:44:10,499 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:10,499 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:10,870 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:10,872 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:10,873 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:10,873 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:10,873 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:10,873 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:10,873 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:10,873 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:10,873 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:10,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 23:44:10,873 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:10,873 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:10,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:44:10,892 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:44:10,895 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:44:10,898 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:44:10,968 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:10,968 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:10,968 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:44:10,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:10,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:10,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:10,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:10,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:10,971 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:10,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:10,975 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:10,979 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:10,980 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:10,980 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:10,980 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:10,980 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:10,980 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~j~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:10,981 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:11,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,069 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:44:11,069 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:44:11,069 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-28 23:44:11,112 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2018-11-28 23:44:11,117 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:44:11,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:11,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:44:11,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:11,118 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:11,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,203 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:44:11,203 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:44:11,204 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-28 23:44:11,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 155 transitions. Complement of second has 7 states. [2018-11-28 23:44:11,255 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:44:11,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:11,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:44:11,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:11,256 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:11,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,357 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:44:11,357 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:44:11,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2018-11-28 23:44:11,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24. Second operand 3 states. Result 123 states and 154 transitions. Complement of second has 6 states. [2018-11-28 23:44:11,392 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:44:11,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-28 23:44:11,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:44:11,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:11,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2018-11-28 23:44:11,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:11,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2018-11-28 23:44:11,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:11,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2018-11-28 23:44:11,400 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:44:11,403 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2018-11-28 23:44:11,403 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:44:11,403 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:44:11,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2018-11-28 23:44:11,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:11,404 INFO L705 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2018-11-28 23:44:11,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2018-11-28 23:44:11,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2018-11-28 23:44:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-28 23:44:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2018-11-28 23:44:11,409 INFO L728 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2018-11-28 23:44:11,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:44:11,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:44:11,410 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2018-11-28 23:44:11,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:11,559 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2018-11-28 23:44:11,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:44:11,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2018-11-28 23:44:11,563 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-28 23:44:11,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2018-11-28 23:44:11,565 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:44:11,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-28 23:44:11,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2018-11-28 23:44:11,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:11,566 INFO L705 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2018-11-28 23:44:11,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2018-11-28 23:44:11,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2018-11-28 23:44:11,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 23:44:11,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2018-11-28 23:44:11,572 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-28 23:44:11,572 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2018-11-28 23:44:11,572 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:44:11,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2018-11-28 23:44:11,573 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:44:11,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:11,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:11,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:11,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:11,574 INFO L794 eck$LassoCheckResult]: Stem: 1578#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet5, main_#t~post6, main_#t~post4, main_#t~post3, main_~i~0, main_~j~0, main_~k~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;main_~k~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~n~0 := main_#t~nondet2;havoc main_#t~nondet2; 1579#L14 assume !!(main_~n~0 < 1000000); 1558#L15 assume main_~k~0 == main_~n~0; 1559#L15-1 main_~i~0 := 0; 1560#L19-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1562#L20-2 assume !!(main_~j~0 < main_~n~0); 1569#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1573#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1574#L4 assume !(0 == __VERIFIER_assert_~cond); 1581#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1582#L22-2 assume !(main_~k~0 < main_~n~0); 1592#L4-8 main_#t~post4 := main_~j~0;main_~j~0 := 1 + main_#t~post4;havoc main_#t~post4; 1583#L20-2 assume !!(main_~j~0 < main_~n~0); 1576#L21 assume 0 != main_#t~nondet5;havoc main_#t~nondet5;main_~k~0 := main_~j~0; 1571#L22-2 [2018-11-28 23:44:11,574 INFO L796 eck$LassoCheckResult]: Loop: 1571#L22-2 assume !!(main_~k~0 < main_~n~0);__VERIFIER_assert_#in~cond := (if main_~k~0 >= 2 * main_~i~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1572#L4 assume !(0 == __VERIFIER_assert_~cond); 1580#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1571#L22-2 [2018-11-28 23:44:11,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,575 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2018-11-28 23:44:11,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:11,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:11,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:11,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:11,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:11,685 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:11,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:11,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:11,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-28 23:44:11,766 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:44:11,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2018-11-28 23:44:11,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:11,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:11,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:11,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:11,841 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:11,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:11,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:11,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:11,841 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:11,841 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,841 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:11,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:11,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 23:44:11,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:11,842 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:11,843 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:44:11,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:44:11,947 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:11,947 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:44:11,958 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:11,958 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:11,966 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:11,988 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:44:12,010 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:12,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:12,452 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:12,454 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:12,454 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:12,454 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:12,454 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:12,454 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:12,455 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:12,455 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:12,455 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:12,455 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 23:44:12,455 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:12,455 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:12,456 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:44:12,467 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:44:12,546 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:12,547 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:12,547 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:44:12,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:12,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:12,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:12,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:12,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:12,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:12,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:12,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:12,554 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:44:12,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:12,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:12,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:12,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:12,556 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:12,557 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:12,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:12,563 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:12,571 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:12,571 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:12,572 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:12,572 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:12,572 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:12,572 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:44:12,573 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:12,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,667 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:44:12,668 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:44:12,668 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2018-11-28 23:44:12,703 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2018-11-28 23:44:12,703 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:44:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:44:12,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:44:12,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,705 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:12,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,750 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:44:12,750 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:44:12,750 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2018-11-28 23:44:12,783 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 115 states and 147 transitions. Complement of second has 7 states. [2018-11-28 23:44:12,784 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:44:12,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:12,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-11-28 23:44:12,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:44:12,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,786 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:12,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,998 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:44:12,999 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:44:12,999 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2018-11-28 23:44:13,130 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21. Second operand 3 states. Result 94 states and 119 transitions. Complement of second has 6 states. [2018-11-28 23:44:13,131 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:44:13,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:44:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2018-11-28 23:44:13,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:44:13,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:13,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2018-11-28 23:44:13,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:13,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:44:13,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:13,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2018-11-28 23:44:13,136 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:13,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2018-11-28 23:44:13,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:13,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:13,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:13,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:13,136 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:13,136 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:13,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 23:44:13,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 23:44:13,137 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2018-11-28 23:44:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:13,137 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:44:13,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:44:13,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:44:13,138 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:13,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:44:13,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:13,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:13,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:13,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:13,138 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:13,138 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:13,138 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:13,139 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:44:13,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:44:13,139 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:13,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:44:13,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:44:13 BoogieIcfgContainer [2018-11-28 23:44:13,146 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:44:13,147 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:44:13,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:44:13,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:44:13,148 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:04" (3/4) ... [2018-11-28 23:44:13,152 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:44:13,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:44:13,153 INFO L168 Benchmark]: Toolchain (without parser) took 9235.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -120.2 MB). Peak memory consumption was 66.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:13,154 INFO L168 Benchmark]: CDTParser took 0.21 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:44:13,154 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:13,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.09 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:44:13,155 INFO L168 Benchmark]: Boogie Preprocessor took 35.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:13,156 INFO L168 Benchmark]: RCFGBuilder took 587.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:13,157 INFO L168 Benchmark]: BuchiAutomizer took 8256.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:13,158 INFO L168 Benchmark]: Witness Printer took 4.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:13,163 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.21 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 295.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.09 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 35.08 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 587.19 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -147.3 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8256.72 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.0 MB). Peak memory consumption was 91.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 9 terminating modules (4 trivial, 3 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 * j + n and consists of 4 locations. One deterministic module has affine ranking function -1 * k + n and consists of 4 locations. One nondeterministic module has affine ranking function n + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -1 * k + n and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.2s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.7s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 173 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 67 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 189 SDtfs, 349 SDslu, 123 SDs, 0 SdLazy, 297 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf98 lsp85 ukn100 mio100 lsp100 div100 bol100 ite114 ukn100 eq152 hnf93 smp83 dnf98 smp100 tf107 neg99 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 39ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.9s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...