./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 0ed9222f 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-0ed9222-m [2019-01-14 03:49:13,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:49:13,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:49:13,170 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:49:13,170 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:49:13,174 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:49:13,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:49:13,177 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:49:13,179 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:49:13,180 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:49:13,181 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:49:13,181 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:49:13,182 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:49:13,183 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:49:13,185 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:49:13,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:49:13,188 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:49:13,190 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:49:13,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:49:13,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:49:13,196 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:49:13,197 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:49:13,200 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:49:13,200 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:49:13,200 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:49:13,201 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:49:13,202 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:49:13,203 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:49:13,204 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:49:13,205 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:49:13,205 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:49:13,206 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:49:13,206 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:49:13,206 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:49:13,207 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:49:13,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:49:13,208 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:49:13,225 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:49:13,225 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:49:13,227 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:49:13,227 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:49:13,227 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:49:13,227 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:49:13,227 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:49:13,228 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:49:13,228 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:49:13,228 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:49:13,228 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:49:13,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:49:13,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:49:13,230 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:49:13,231 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:49:13,231 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:49:13,231 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:49:13,231 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:49:13,231 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:49:13,232 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:49:13,232 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:49:13,233 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:49:13,233 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 [2019-01-14 03:49:13,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:49:13,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:49:13,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:49:13,301 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:49:13,302 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:49:13,302 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-14 03:49:13,355 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87283bcc/c15b9f825b864dafafa5acf609fee8b7/FLAG07313121c [2019-01-14 03:49:13,750 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:49:13,751 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested6_true-unreach-call_true-termination.i [2019-01-14 03:49:13,759 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87283bcc/c15b9f825b864dafafa5acf609fee8b7/FLAG07313121c [2019-01-14 03:49:14,131 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d87283bcc/c15b9f825b864dafafa5acf609fee8b7 [2019-01-14 03:49:14,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:49:14,136 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:49:14,137 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:49:14,137 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:49:14,141 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:49:14,142 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd7693 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14, skipping insertion in model container [2019-01-14 03:49:14,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:49:14,173 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:49:14,348 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:49:14,351 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:49:14,370 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:49:14,383 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:49:14,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14 WrapperNode [2019-01-14 03:49:14,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:49:14,385 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:49:14,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:49:14,385 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:49:14,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:49:14,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:49:14,419 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:49:14,419 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:49:14,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,439 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (1/1) ... [2019-01-14 03:49:14,440 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:49:14,441 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:49:14,442 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:49:14,442 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:49:14,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (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 [2019-01-14 03:49:14,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:49:14,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:49:14,929 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:49:14,929 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-14 03:49:14,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:14 BoogieIcfgContainer [2019-01-14 03:49:14,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:49:14,931 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:49:14,931 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:49:14,934 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:49:14,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:14,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:49:14" (1/3) ... [2019-01-14 03:49:14,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6da73638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:49:14, skipping insertion in model container [2019-01-14 03:49:14,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:14,937 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:49:14" (2/3) ... [2019-01-14 03:49:14,937 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6da73638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:49:14, skipping insertion in model container [2019-01-14 03:49:14,937 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:49:14,938 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:14" (3/3) ... [2019-01-14 03:49:14,939 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested6_true-unreach-call_true-termination.i [2019-01-14 03:49:15,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:49:15,003 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:49:15,003 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:49:15,003 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:49:15,003 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:49:15,004 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:49:15,004 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:49:15,004 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:49:15,004 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:49:15,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-14 03:49:15,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 03:49:15,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:15,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:15,055 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:49:15,055 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:15,055 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:49:15,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2019-01-14 03:49:15,057 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-01-14 03:49:15,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:15,058 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:15,058 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-14 03:49:15,058 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:15,066 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 [2019-01-14 03:49:15,066 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 [2019-01-14 03:49:15,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,073 INFO L82 PathProgramCache]: Analyzing trace with hash 959370, now seen corresponding path program 1 times [2019-01-14 03:49:15,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:15,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:15,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:15,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:15,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,171 INFO L82 PathProgramCache]: Analyzing trace with hash 50890, now seen corresponding path program 1 times [2019-01-14 03:49:15,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:15,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:15,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:15,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:15,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158303, now seen corresponding path program 1 times [2019-01-14 03:49:15,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:15,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:15,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:15,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:15,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:15,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:49:15,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 03:49:15,366 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:15,367 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:15,368 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:15,368 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:15,368 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:15,368 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:15,368 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:15,369 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:15,369 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-14 03:49:15,369 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:15,369 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:15,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:15,532 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 03:49:15,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:15,695 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:49:15,825 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 03:49:15,833 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:15,833 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 [2019-01-14 03:49:15,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:15,839 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 [2019-01-14 03:49:15,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:15,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:16,077 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:16,079 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:16,079 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:16,079 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:16,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:16,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:16,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:16,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:16,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:16,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration1_Loop [2019-01-14 03:49:16,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:16,082 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:16,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:16,360 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:16,365 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:16,367 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 [2019-01-14 03:49:16,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:16,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:16,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:16,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:16,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:16,373 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:16,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:16,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:16,414 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:16,415 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:16,419 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:16,419 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:16,420 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:16,424 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 [] [2019-01-14 03:49:16,426 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:16,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:16,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:16,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:16,561 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 [2019-01-14 03:49:16,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 3 states. [2019-01-14 03:49:16,730 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. [2019-01-14 03:49:16,731 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 [2019-01-14 03:49:16,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:16,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2019-01-14 03:49:16,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 3 letters. [2019-01-14 03:49:16,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:16,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 03:49:16,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:16,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 63 transitions. Stem has 4 letters. Loop has 6 letters. [2019-01-14 03:49:16,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:16,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 90 transitions. [2019-01-14 03:49:16,749 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 03:49:16,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 26 states and 33 transitions. [2019-01-14 03:49:16,756 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 03:49:16,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 03:49:16,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 33 transitions. [2019-01-14 03:49:16,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:16,759 INFO L706 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 03:49:16,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 33 transitions. [2019-01-14 03:49:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-01-14 03:49:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 03:49:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2019-01-14 03:49:16,796 INFO L729 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2019-01-14 03:49:16,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:49:16,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:49:16,802 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 4 states. [2019-01-14 03:49:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:16,924 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-01-14 03:49:16,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:49:16,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-01-14 03:49:16,928 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-01-14 03:49:16,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-01-14 03:49:16,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2019-01-14 03:49:16,931 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-01-14 03:49:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-01-14 03:49:16,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:16,931 INFO L706 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-01-14 03:49:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-01-14 03:49:16,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-01-14 03:49:16,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 03:49:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-01-14 03:49:16,937 INFO L729 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 03:49:16,937 INFO L609 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-01-14 03:49:16,937 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:49:16,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2019-01-14 03:49:16,938 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 03:49:16,939 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:16,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:16,943 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:49:16,944 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:49:16,944 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 [2019-01-14 03:49:16,944 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 [2019-01-14 03:49:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 1 times [2019-01-14 03:49:16,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:16,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:16,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:16,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:16,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:16,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1819467, now seen corresponding path program 1 times [2019-01-14 03:49:16,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:16,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:16,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:16,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:16,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:16,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:49:16,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 03:49:16,990 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:49:16,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 03:49:16,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 03:49:16,991 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 4 states. [2019-01-14 03:49:17,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:17,078 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-14 03:49:17,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 03:49:17,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-14 03:49:17,082 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 03:49:17,083 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 35 transitions. [2019-01-14 03:49:17,083 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 03:49:17,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 03:49:17,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-01-14 03:49:17,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:17,084 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 03:49:17,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-01-14 03:49:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-14 03:49:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 03:49:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-14 03:49:17,087 INFO L729 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 03:49:17,088 INFO L609 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-14 03:49:17,088 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:49:17,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2019-01-14 03:49:17,089 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 03:49:17,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:17,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:17,090 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:49:17,090 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:49:17,090 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 [2019-01-14 03:49:17,090 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 [2019-01-14 03:49:17,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:17,091 INFO L82 PathProgramCache]: Analyzing trace with hash 29740491, now seen corresponding path program 2 times [2019-01-14 03:49:17,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:17,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:17,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 1 times [2019-01-14 03:49:17,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:17,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:49:17,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1589140493, now seen corresponding path program 1 times [2019-01-14 03:49:17,125 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:17,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:17,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:17,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:17,558 WARN L181 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 18 [2019-01-14 03:49:17,578 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:17,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:17,578 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:17,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:17,579 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:17,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:17,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:17,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:17,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:49:17,580 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:17,582 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:17,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:17,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:17,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:17,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:17,795 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:17,795 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 [2019-01-14 03:49:17,800 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:17,800 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 [2019-01-14 03:49:17,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:17,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:18,153 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:18,155 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:18,156 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:18,156 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:18,156 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:18,156 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:18,156 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:18,156 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:18,156 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:18,157 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration3_Loop [2019-01-14 03:49:18,157 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:18,157 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:18,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:18,307 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:18,309 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 [2019-01-14 03:49:18,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:18,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:18,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:18,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:18,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:18,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:18,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:18,322 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:18,338 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:18,338 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:18,339 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:18,340 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:18,341 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:18,341 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 [] [2019-01-14 03:49:18,341 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:18,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:18,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:18,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:18,479 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 [2019-01-14 03:49:18,479 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 35 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-14 03:49:18,547 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. [2019-01-14 03:49:18,549 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 [2019-01-14 03:49:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:18,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 03:49:18,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 6 letters. [2019-01-14 03:49:18,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:18,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 11 letters. Loop has 6 letters. [2019-01-14 03:49:18,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:18,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 5 letters. Loop has 12 letters. [2019-01-14 03:49:18,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:18,552 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 90 transitions. [2019-01-14 03:49:18,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 03:49:18,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 56 states and 71 transitions. [2019-01-14 03:49:18,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 03:49:18,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-14 03:49:18,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 71 transitions. [2019-01-14 03:49:18,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:18,557 INFO L706 BuchiCegarLoop]: Abstraction has 56 states and 71 transitions. [2019-01-14 03:49:18,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 71 transitions. [2019-01-14 03:49:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 43. [2019-01-14 03:49:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-14 03:49:18,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2019-01-14 03:49:18,562 INFO L729 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-14 03:49:18,562 INFO L609 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-14 03:49:18,562 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:49:18,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 54 transitions. [2019-01-14 03:49:18,563 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-01-14 03:49:18,563 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:18,563 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:18,564 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:49:18,564 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:18,564 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 [2019-01-14 03:49:18,564 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 [2019-01-14 03:49:18,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:18,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1484158290, now seen corresponding path program 1 times [2019-01-14 03:49:18,565 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:18,565 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:18,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:18,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:18,587 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 1 times [2019-01-14 03:49:18,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:18,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:18,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:18,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:18,605 INFO L82 PathProgramCache]: Analyzing trace with hash 2128734878, now seen corresponding path program 1 times [2019-01-14 03:49:18,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:18,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:18,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:18,662 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:18,663 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:18,663 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:18,663 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:18,663 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:18,663 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:18,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:18,664 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:18,664 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:49:18,664 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:18,664 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:18,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:18,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:18,812 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 [2019-01-14 03:49:18,817 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:18,817 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:18,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:18,823 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 [2019-01-14 03:49:18,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:18,845 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 [2019-01-14 03:49:18,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:18,877 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:19,234 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:19,236 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:19,237 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:19,237 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:19,237 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:19,237 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:19,237 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:19,237 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:19,238 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:19,238 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration4_Loop [2019-01-14 03:49:19,238 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:19,238 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:19,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:19,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:19,398 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:19,398 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:19,399 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 [2019-01-14 03:49:19,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:19,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:19,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:19,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:19,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:19,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:19,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:19,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:19,404 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 [2019-01-14 03:49:19,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:19,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:19,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:19,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:19,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:19,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:19,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:19,413 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:19,420 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:19,420 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:19,420 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:19,421 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:19,421 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:19,421 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 [] [2019-01-14 03:49:19,422 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:19,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:19,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:19,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:19,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:19,568 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 [2019-01-14 03:49:19,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 54 transitions. cyclomatic complexity: 15 Second operand 3 states. [2019-01-14 03:49:19,761 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. [2019-01-14 03:49:19,762 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 [2019-01-14 03:49:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:19,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 03:49:19,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 3 letters. [2019-01-14 03:49:19,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:19,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 10 letters. Loop has 3 letters. [2019-01-14 03:49:19,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:19,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 6 letters. [2019-01-14 03:49:19,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:19,764 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 132 states and 167 transitions. [2019-01-14 03:49:19,768 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 25 [2019-01-14 03:49:19,770 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 132 states to 97 states and 121 transitions. [2019-01-14 03:49:19,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-14 03:49:19,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-14 03:49:19,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 121 transitions. [2019-01-14 03:49:19,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:19,771 INFO L706 BuchiCegarLoop]: Abstraction has 97 states and 121 transitions. [2019-01-14 03:49:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 121 transitions. [2019-01-14 03:49:19,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2019-01-14 03:49:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-14 03:49:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 83 transitions. [2019-01-14 03:49:19,782 INFO L729 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-14 03:49:19,782 INFO L609 BuchiCegarLoop]: Abstraction has 67 states and 83 transitions. [2019-01-14 03:49:19,782 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:49:19,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 83 transitions. [2019-01-14 03:49:19,785 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 19 [2019-01-14 03:49:19,786 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:19,786 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:19,787 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:49:19,787 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-01-14 03:49:19,787 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 [2019-01-14 03:49:19,787 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 [2019-01-14 03:49:19,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1340048366, now seen corresponding path program 1 times [2019-01-14 03:49:19,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:19,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:19,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:19,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:19,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:19,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:49:19,878 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 [2019-01-14 03:49:19,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:19,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:20,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:49:20,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-01-14 03:49:20,070 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:49:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:20,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1771408835, now seen corresponding path program 2 times [2019-01-14 03:49:20,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:20,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:20,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:20,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:20,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:20,254 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:20,254 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:20,254 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:20,254 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:20,255 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:20,255 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:20,255 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:20,255 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:20,255 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-14 03:49:20,255 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:20,255 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:20,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:20,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:20,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:20,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:20,587 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 [2019-01-14 03:49:20,599 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:20,599 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) [2019-01-14 03:49:20,647 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:20,647 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 [2019-01-14 03:49:21,056 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:21,058 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:21,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:21,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:21,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:21,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:21,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:21,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:21,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:21,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration5_Loop [2019-01-14 03:49:21,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:21,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:21,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:21,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:21,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:21,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:21,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:21,175 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:21,175 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 [2019-01-14 03:49:21,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:21,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:21,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:21,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:21,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:21,181 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:21,181 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:21,186 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:21,190 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:21,191 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:21,191 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:21,191 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:21,191 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:21,191 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 [] [2019-01-14 03:49:21,192 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:21,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:21,290 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 [2019-01-14 03:49:21,290 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-14 03:49:21,338 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. [2019-01-14 03:49:21,344 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 [2019-01-14 03:49:21,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:21,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 03:49:21,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 03:49:21,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:21,345 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:21,421 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 [2019-01-14 03:49:21,421 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-14 03:49:21,457 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. [2019-01-14 03:49:21,463 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 [2019-01-14 03:49:21,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:21,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-14 03:49:21,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 03:49:21,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:21,464 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:21,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:21,580 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 [2019-01-14 03:49:21,580 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 83 transitions. cyclomatic complexity: 24 Second operand 3 states. [2019-01-14 03:49:21,618 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. [2019-01-14 03:49:21,619 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 [2019-01-14 03:49:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:21,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-14 03:49:21,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 03:49:21,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:21,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 20 letters. Loop has 6 letters. [2019-01-14 03:49:21,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:21,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 12 letters. [2019-01-14 03:49:21,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:21,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 154 transitions. [2019-01-14 03:49:21,645 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-14 03:49:21,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 74 states and 92 transitions. [2019-01-14 03:49:21,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 03:49:21,649 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-01-14 03:49:21,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 92 transitions. [2019-01-14 03:49:21,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:21,650 INFO L706 BuchiCegarLoop]: Abstraction has 74 states and 92 transitions. [2019-01-14 03:49:21,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 92 transitions. [2019-01-14 03:49:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 48. [2019-01-14 03:49:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 03:49:21,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2019-01-14 03:49:21,657 INFO L729 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-01-14 03:49:21,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 03:49:21,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-14 03:49:21,660 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand 11 states. [2019-01-14 03:49:21,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:21,806 INFO L93 Difference]: Finished difference Result 147 states and 180 transitions. [2019-01-14 03:49:21,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 03:49:21,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 147 states and 180 transitions. [2019-01-14 03:49:21,813 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-14 03:49:21,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 147 states to 143 states and 176 transitions. [2019-01-14 03:49:21,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-14 03:49:21,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-14 03:49:21,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 143 states and 176 transitions. [2019-01-14 03:49:21,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:49:21,817 INFO L706 BuchiCegarLoop]: Abstraction has 143 states and 176 transitions. [2019-01-14 03:49:21,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states and 176 transitions. [2019-01-14 03:49:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 60. [2019-01-14 03:49:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-14 03:49:21,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2019-01-14 03:49:21,825 INFO L729 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-14 03:49:21,825 INFO L609 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2019-01-14 03:49:21,825 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:49:21,825 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 75 transitions. [2019-01-14 03:49:21,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 03:49:21,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:49:21,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:49:21,829 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 03:49:21,829 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 03:49:21,830 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 [2019-01-14 03:49:21,830 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 [2019-01-14 03:49:21,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:21,830 INFO L82 PathProgramCache]: Analyzing trace with hash 279041640, now seen corresponding path program 1 times [2019-01-14 03:49:21,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:21,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:21,831 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:49:21,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,903 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:21,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:49:21,904 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 [2019-01-14 03:49:21,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:21,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:21,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:21,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:49:21,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 03:49:21,969 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:49:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash 69739, now seen corresponding path program 2 times [2019-01-14 03:49:21,970 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:49:21,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:49:21,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:21,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:49:21,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:49:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:49:22,042 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:22,042 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:22,042 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:22,042 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:22,043 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:49:22,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:22,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:22,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:22,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-14 03:49:22,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:22,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:22,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:22,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:22,149 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:22,149 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:22,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:22,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:22,158 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:49:22,158 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 [2019-01-14 03:49:22,179 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:49:22,179 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 [2019-01-14 03:49:22,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:49:22,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:49:22,647 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:49:22,649 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:49:22,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:49:22,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:49:22,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:49:22,650 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:49:22,650 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:49:22,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:49:22,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:49:22,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested6_true-unreach-call_true-termination.i_Iteration6_Loop [2019-01-14 03:49:22,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:49:22,650 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:49:22,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:22,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 03:49:22,729 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:49:22,729 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:49:22,730 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 [2019-01-14 03:49:22,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:22,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:22,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:22,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:22,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:22,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:22,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:22,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:49:22,735 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 [2019-01-14 03:49:22,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:49:22,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:49:22,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:49:22,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:49:22,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:49:22,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:49:22,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:49:22,744 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:49:22,748 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 03:49:22,749 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 03:49:22,749 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:49:22,749 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:49:22,749 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:49:22,749 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 [] [2019-01-14 03:49:22,752 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:49:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:22,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:22,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:22,821 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 [2019-01-14 03:49:22,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-14 03:49:22,860 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. [2019-01-14 03:49:22,861 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 [2019-01-14 03:49:22,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 03:49:22,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:49:22,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:22,863 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:22,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:22,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:22,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:22,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:22,917 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 [2019-01-14 03:49:22,917 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-14 03:49:22,945 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. [2019-01-14 03:49:22,946 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 [2019-01-14 03:49:22,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 03:49:22,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:49:22,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:22,947 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:49:22,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:49:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:23,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:49:23,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:49:23,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:49:23,175 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 [2019-01-14 03:49:23,175 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 75 transitions. cyclomatic complexity: 21 Second operand 3 states. [2019-01-14 03:49:23,310 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. [2019-01-14 03:49:23,311 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 [2019-01-14 03:49:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:49:23,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-01-14 03:49:23,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2019-01-14 03:49:23,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:23,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-14 03:49:23,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:23,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 03:49:23,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:49:23,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 119 transitions. [2019-01-14 03:49:23,317 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:23,317 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 0 states and 0 transitions. [2019-01-14 03:49:23,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:49:23,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:49:23,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:49:23,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:23,318 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:23,318 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:23,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 03:49:23,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 03:49:23,318 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2019-01-14 03:49:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:49:23,319 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:49:23,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:49:23,319 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:49:23,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:23,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:49:23,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:49:23,319 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:49:23,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:49:23,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:49:23,324 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:23,324 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:23,324 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:49:23,324 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 03:49:23,324 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:49:23,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:49:23,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:49:23,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:49:23 BoogieIcfgContainer [2019-01-14 03:49:23,334 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:49:23,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:49:23,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:49:23,334 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:49:23,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:49:14" (3/4) ... [2019-01-14 03:49:23,340 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:49:23,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:49:23,341 INFO L168 Benchmark]: Toolchain (without parser) took 9206.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -137.7 MB). Peak memory consumption was 71.5 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:23,342 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:23,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 247.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:23,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:49:23,345 INFO L168 Benchmark]: Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:23,347 INFO L168 Benchmark]: RCFGBuilder took 489.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:23,348 INFO L168 Benchmark]: BuchiAutomizer took 8402.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-01-14 03:49:23,349 INFO L168 Benchmark]: Witness Printer took 6.03 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. [2019-01-14 03:49:23,355 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 247.51 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 935.3 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 33.43 ms. Allocated memory is still 1.0 GB. Free memory is still 935.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.94 ms. Allocated memory is still 1.0 GB. Free memory was 935.3 MB in the beginning and 929.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 489.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 929.9 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8402.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.2 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * Witness Printer took 6.03 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.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 5.8s. Construction of modules took 0.7s. Büchi inclusion checks took 1.4s. 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: 54ms 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...