./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/loop-invgen/nested9_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 041ac1710be6e1a9f4a6c44510c9851574d3d115 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:44:05,066 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:44:05,068 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:44:05,089 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:44:05,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:44:05,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:44:05,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:44:05,096 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:44:05,099 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:44:05,101 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:44:05,103 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:44:05,104 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:44:05,105 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:44:05,107 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:44:05,109 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:44:05,109 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:44:05,118 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:44:05,123 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:44:05,128 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:44:05,130 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:44:05,135 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:44:05,137 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:44:05,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:44:05,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:44:05,143 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:44:05,144 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:44:05,145 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:44:05,146 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:44:05,149 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:44:05,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:44:05,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:44:05,151 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:44:05,151 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:44:05,151 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:44:05,152 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:44:05,154 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:44:05,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-28 23:44:05,185 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:44:05,185 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:44:05,187 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:44:05,187 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:44:05,188 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:44:05,188 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:44:05,188 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:44:05,188 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:44:05,188 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:44:05,188 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:44:05,189 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:44:05,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:44:05,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 23:44:05,189 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:44:05,190 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:44:05,191 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 23:44:05,191 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:44:05,191 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:44:05,191 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:44:05,193 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:44:05,193 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 23:44:05,193 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:44:05,193 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:44:05,193 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:44:05,194 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:44:05,194 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:44:05,194 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:44:05,194 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:44:05,195 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:44:05,195 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:44:05,195 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:44:05,197 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:44:05,197 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 -> 041ac1710be6e1a9f4a6c44510c9851574d3d115 [2018-11-28 23:44:05,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:44:05,267 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:44:05,274 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:44:05,276 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:44:05,277 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:44:05,277 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-28 23:44:05,352 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0adb6797/bbd86316c6e8465e97cc1d0dfddb610c/FLAGf0341a4fe [2018-11-28 23:44:05,775 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:44:05,776 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/nested9_true-unreach-call_true-termination.i [2018-11-28 23:44:05,781 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0adb6797/bbd86316c6e8465e97cc1d0dfddb610c/FLAGf0341a4fe [2018-11-28 23:44:06,175 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0adb6797/bbd86316c6e8465e97cc1d0dfddb610c [2018-11-28 23:44:06,180 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:44:06,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:44:06,182 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:06,182 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:44:06,186 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:44:06,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a68efe3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06, skipping insertion in model container [2018-11-28 23:44:06,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,199 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:44:06,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:44:06,451 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:06,456 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:44:06,478 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:44:06,495 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:44:06,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06 WrapperNode [2018-11-28 23:44:06,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:44:06,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:06,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:44:06,497 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:44:06,508 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,515 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:44:06,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:44:06,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:44:06,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:44:06,551 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,569 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... [2018-11-28 23:44:06,574 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:44:06,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:44:06,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:44:06,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:44:06,576 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:06,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:44:06,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:44:07,085 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:44:07,086 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-28 23:44:07,086 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:07 BoogieIcfgContainer [2018-11-28 23:44:07,087 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:44:07,087 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:44:07,088 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:44:07,092 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:44:07,093 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:07,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:44:06" (1/3) ... [2018-11-28 23:44:07,095 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a85d72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:07, skipping insertion in model container [2018-11-28 23:44:07,095 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:07,095 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:44:06" (2/3) ... [2018-11-28 23:44:07,096 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a85d72f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:44:07, skipping insertion in model container [2018-11-28 23:44:07,096 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:44:07,097 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:07" (3/3) ... [2018-11-28 23:44:07,099 INFO L375 chiAutomizerObserver]: Analyzing ICFG nested9_true-unreach-call_true-termination.i [2018-11-28 23:44:07,179 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:44:07,182 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:44:07,182 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:44:07,182 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:44:07,184 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:44:07,184 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:44:07,184 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:44:07,184 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:44:07,185 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:44:07,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:44:07,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:44:07,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:07,228 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:07,236 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:07,236 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:07,236 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:44:07,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:44:07,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:44:07,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:07,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:07,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:07,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:07,248 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue ~__BLAST_NONDET~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 4#L16true assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 5#L17true assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 7#L18true assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 11#L19true assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 8#L19-1true main_~i~0 := 0; 6#L20-3true [2018-11-28 23:44:07,249 INFO L796 eck$LassoCheckResult]: Loop: 6#L20-3true assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 9#L21-3true assume !true; 10#L20-2true main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 6#L20-3true [2018-11-28 23:44:07,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:07,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 1 times [2018-11-28 23:44:07,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:07,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:07,387 INFO L82 PathProgramCache]: Analyzing trace with hash 62625, now seen corresponding path program 1 times [2018-11-28 23:44:07,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:07,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:07,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:07,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:07,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:07,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:44:07,431 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:44:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-28 23:44:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-28 23:44:07,453 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-28 23:44:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:07,464 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-11-28 23:44:07,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:44:07,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 25 transitions. [2018-11-28 23:44:07,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:44:07,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 14 states and 16 transitions. [2018-11-28 23:44:07,474 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-28 23:44:07,474 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-28 23:44:07,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-28 23:44:07,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:07,476 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:44:07,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-28 23:44:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-28 23:44:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-28 23:44:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-28 23:44:07,510 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:44:07,511 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-28 23:44:07,511 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:44:07,511 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-28 23:44:07,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:44:07,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:07,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:07,513 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:07,514 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:07,514 INFO L794 eck$LassoCheckResult]: Stem: 58#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 57#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 46#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 47#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 50#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 51#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 52#L19-1 main_~i~0 := 0; 48#L20-3 [2018-11-28 23:44:07,514 INFO L796 eck$LassoCheckResult]: Loop: 48#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 49#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 53#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 48#L20-3 [2018-11-28 23:44:07,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:07,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907757, now seen corresponding path program 2 times [2018-11-28 23:44:07,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:07,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:07,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:07,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:07,541 INFO L82 PathProgramCache]: Analyzing trace with hash 61788, now seen corresponding path program 1 times [2018-11-28 23:44:07,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:07,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:07,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:07,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash 763900016, now seen corresponding path program 1 times [2018-11-28 23:44:07,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:07,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:07,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:07,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:07,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:07,702 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:07,704 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:07,704 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:07,704 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:07,704 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:07,704 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:07,705 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:07,705 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:07,705 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 23:44:07,705 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:07,705 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:07,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:07,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:07,901 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:07,902 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:07,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:07,908 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) [2018-11-28 23:44:07,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:07,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:08,131 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:08,136 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:08,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:08,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:08,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:08,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:08,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:08,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:08,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:08,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration2_Loop [2018-11-28 23:44:08,138 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:08,138 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:08,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:08,277 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:44:08,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:08,453 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:08,459 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:08,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:08,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:08,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:08,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:08,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:08,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:08,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:08,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:08,478 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:08,489 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:08,490 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:08,492 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:08,492 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:08,493 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:08,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 23:44:08,495 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:08,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:08,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:08,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:08,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:08,671 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:44:08,672 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:44:08,970 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 16 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 36 states and 46 transitions. Complement of second has 8 states. [2018-11-28 23:44:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-28 23:44:08,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:44:08,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:44:08,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 7 letters. Loop has 6 letters. [2018-11-28 23:44:08,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:08,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2018-11-28 23:44:08,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:44:08,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 44 transitions. [2018-11-28 23:44:08,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:44:08,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:44:08,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2018-11-28 23:44:08,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:08,981 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2018-11-28 23:44:08,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2018-11-28 23:44:08,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2018-11-28 23:44:08,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-28 23:44:08,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-11-28 23:44:08,985 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:44:08,986 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-11-28 23:44:08,986 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:44:08,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 33 transitions. [2018-11-28 23:44:08,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-28 23:44:08,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:08,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:08,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:08,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:44:08,988 INFO L794 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 175#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 154#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 155#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 160#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 166#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 167#L19-1 main_~i~0 := 0; 168#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 157#L21-3 [2018-11-28 23:44:08,989 INFO L796 eck$LassoCheckResult]: Loop: 157#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 161#L22-2 assume !(main_~k~0 < main_~j~0); 169#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 170#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 164#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 156#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 157#L21-3 [2018-11-28 23:44:08,989 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:08,989 INFO L82 PathProgramCache]: Analyzing trace with hash 179565651, now seen corresponding path program 1 times [2018-11-28 23:44:08,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:08,990 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:08,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:08,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:09,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:09,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2077067147, now seen corresponding path program 1 times [2018-11-28 23:44:09,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:09,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:09,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:09,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:09,021 INFO L82 PathProgramCache]: Analyzing trace with hash -696682915, now seen corresponding path program 1 times [2018-11-28 23:44:09,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:09,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:09,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:09,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:44:09,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 23:44:09,215 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:09,215 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:09,215 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:09,215 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:09,216 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:09,216 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:09,216 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:09,216 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:09,217 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:09,217 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:09,217 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:09,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:09,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:09,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:09,529 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-11-28 23:44:09,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:09,587 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) [2018-11-28 23:44:09,597 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:09,597 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:44:09,648 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:09,648 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:09,974 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:09,977 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:09,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:09,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:09,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:09,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:09,978 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:09,978 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:09,978 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:09,978 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration3_Loop [2018-11-28 23:44:09,978 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:09,978 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:09,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:10,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:10,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:10,144 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:10,144 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:10,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:10,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:10,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:10,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:10,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:10,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:10,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:10,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:10,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:10,175 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:10,175 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:10,176 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:10,176 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:10,176 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:10,176 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -1*ULTIMATE.start_main_~i~0 + 1 Supporting invariants [] [2018-11-28 23:44:10,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:10,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:10,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:10,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:10,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:10,424 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:44:10,424 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-28 23:44:10,790 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 33 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 95 states and 129 transitions. Complement of second has 14 states. [2018-11-28 23:44:10,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:44:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2018-11-28 23:44:10,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:44:10,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:10,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:44:10,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:10,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 35 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 23:44:10,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:10,795 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 129 transitions. [2018-11-28 23:44:10,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 23:44:10,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 93 states and 127 transitions. [2018-11-28 23:44:10,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:44:10,804 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-28 23:44:10,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 93 states and 127 transitions. [2018-11-28 23:44:10,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:10,804 INFO L705 BuchiCegarLoop]: Abstraction has 93 states and 127 transitions. [2018-11-28 23:44:10,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states and 127 transitions. [2018-11-28 23:44:10,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 62. [2018-11-28 23:44:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-28 23:44:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 87 transitions. [2018-11-28 23:44:10,814 INFO L728 BuchiCegarLoop]: Abstraction has 62 states and 87 transitions. [2018-11-28 23:44:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:44:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:44:10,814 INFO L87 Difference]: Start difference. First operand 62 states and 87 transitions. Second operand 4 states. [2018-11-28 23:44:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:10,892 INFO L93 Difference]: Finished difference Result 64 states and 85 transitions. [2018-11-28 23:44:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:44:10,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 85 transitions. [2018-11-28 23:44:10,900 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:44:10,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 63 states and 84 transitions. [2018-11-28 23:44:10,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:44:10,902 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:44:10,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 84 transitions. [2018-11-28 23:44:10,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:10,903 INFO L705 BuchiCegarLoop]: Abstraction has 63 states and 84 transitions. [2018-11-28 23:44:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 84 transitions. [2018-11-28 23:44:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-28 23:44:10,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-28 23:44:10,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2018-11-28 23:44:10,910 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-28 23:44:10,910 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 82 transitions. [2018-11-28 23:44:10,911 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:44:10,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 82 transitions. [2018-11-28 23:44:10,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:44:10,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:10,913 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:10,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:10,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:10,915 INFO L794 eck$LassoCheckResult]: Stem: 515#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 514#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 489#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 490#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 491#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 496#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 497#L19-1 main_~i~0 := 0; 492#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 493#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 526#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 527#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 507#L21-3 [2018-11-28 23:44:10,915 INFO L796 eck$LassoCheckResult]: Loop: 507#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 510#L22-2 assume !(main_~k~0 < main_~j~0); 506#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 507#L21-3 [2018-11-28 23:44:10,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:10,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 2 times [2018-11-28 23:44:10,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:10,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:10,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:10,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash 69720, now seen corresponding path program 1 times [2018-11-28 23:44:10,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:10,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:10,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,939 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:10,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:10,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:10,946 INFO L82 PathProgramCache]: Analyzing trace with hash -735469495, now seen corresponding path program 2 times [2018-11-28 23:44:10,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:10,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:10,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:10,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:11,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:11,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:11,050 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:44:11,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-28 23:44:11,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:11,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 23:44:11,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-28 23:44:11,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2018-11-28 23:44:11,195 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:11,195 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:11,195 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:11,195 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:11,196 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:11,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:11,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:11,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 23:44:11,199 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:11,199 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:11,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:11,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:11,307 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:11,308 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:11,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:11,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:11,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:11,342 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:44:11,419 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:11,419 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,799 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:11,802 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:11,802 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:11,802 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:11,802 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:11,802 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:11,802 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:11,803 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:11,803 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:11,803 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration4_Loop [2018-11-28 23:44:11,803 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:11,803 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:11,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:11,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:11,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:11,856 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:11,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:11,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:11,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:11,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:11,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:11,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:11,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:11,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:11,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:11,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:11,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:11,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:11,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:11,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:11,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:11,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:11,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:11,871 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:11,878 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:11,878 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:11,878 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:11,879 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:11,879 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:11,879 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:11,879 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:11,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:11,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:11,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:11,990 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:44:11,990 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 23:44:12,011 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 65 states and 86 transitions. Complement of second has 5 states. [2018-11-28 23:44:12,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:12,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:44:12,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:44:12,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,016 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:12,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:12,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:44:12,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 23:44:12,296 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 65 states and 86 transitions. Complement of second has 5 states. [2018-11-28 23:44:12,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:44:12,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:44:12,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,299 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:12,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:12,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:12,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:12,367 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:44:12,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25 Second operand 4 states. [2018-11-28 23:44:12,436 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 82 transitions. cyclomatic complexity: 25. Second operand 4 states. Result 129 states and 171 transitions. Complement of second has 8 states. [2018-11-28 23:44:12,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2018-11-28 23:44:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-28 23:44:12,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 14 letters. Loop has 3 letters. [2018-11-28 23:44:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:44:12,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:12,441 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 171 transitions. [2018-11-28 23:44:12,445 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-28 23:44:12,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 115 states and 153 transitions. [2018-11-28 23:44:12,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:44:12,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-11-28 23:44:12,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 153 transitions. [2018-11-28 23:44:12,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:12,448 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 153 transitions. [2018-11-28 23:44:12,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 153 transitions. [2018-11-28 23:44:12,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 86. [2018-11-28 23:44:12,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 23:44:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 120 transitions. [2018-11-28 23:44:12,456 INFO L728 BuchiCegarLoop]: Abstraction has 86 states and 120 transitions. [2018-11-28 23:44:12,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 23:44:12,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-28 23:44:12,458 INFO L87 Difference]: Start difference. First operand 86 states and 120 transitions. Second operand 8 states. [2018-11-28 23:44:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:12,748 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-11-28 23:44:12,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:44:12,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 114 transitions. [2018-11-28 23:44:12,750 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:44:12,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 34 states and 40 transitions. [2018-11-28 23:44:12,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-11-28 23:44:12,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-11-28 23:44:12,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2018-11-28 23:44:12,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:12,752 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-28 23:44:12,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2018-11-28 23:44:12,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2018-11-28 23:44:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-28 23:44:12,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2018-11-28 23:44:12,754 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 23:44:12,755 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2018-11-28 23:44:12,755 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:44:12,755 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2018-11-28 23:44:12,755 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-28 23:44:12,756 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:12,756 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:12,760 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:12,760 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:12,760 INFO L794 eck$LassoCheckResult]: Stem: 1232#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 1231#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 1209#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 1210#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 1211#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 1216#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 1217#L19-1 main_~i~0 := 0; 1212#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1213#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1220#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1223#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1218#L21-3 [2018-11-28 23:44:12,761 INFO L796 eck$LassoCheckResult]: Loop: 1218#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 1219#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1228#L4 assume !(0 == __VERIFIER_assert_~cond); 1233#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1234#L22-2 assume !(main_~k~0 < main_~j~0); 1224#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1225#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1221#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1222#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1218#L21-3 [2018-11-28 23:44:12,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,761 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 3 times [2018-11-28 23:44:12,761 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:12,761 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:12,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,763 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:12,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:12,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:12,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1576881701, now seen corresponding path program 1 times [2018-11-28 23:44:12,797 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:12,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:12,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:12,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash -604215978, now seen corresponding path program 1 times [2018-11-28 23:44:12,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:12,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:12,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:12,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:13,202 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:44:13,298 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:13,298 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:13,298 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:13,298 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:13,299 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:13,299 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,299 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:13,299 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:13,299 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 23:44:13,302 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:13,302 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:13,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,530 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:13,530 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:13,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:13,567 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:13,567 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,589 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:13,589 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:13,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:13,592 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,616 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:13,616 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:13,618 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:13,619 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:13,640 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:13,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:13,902 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:13,904 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:13,904 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:13,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:13,905 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:13,905 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:13,905 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:13,905 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:13,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:13,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration5_Loop [2018-11-28 23:44:13,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:13,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:13,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:13,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:14,042 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:14,042 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:14,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:14,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:14,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:14,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:14,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:14,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:14,044 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:14,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:14,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:14,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:14,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:14,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:14,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:14,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:14,047 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:14,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:14,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:14,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:14,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:14,053 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:14,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:14,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:14,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:14,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:14,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:14,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:14,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:14,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:14,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:14,056 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:14,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:14,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:14,056 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:14,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:14,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:14,063 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:14,071 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:14,071 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:14,071 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:14,072 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:14,072 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:14,072 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-28 23:44:14,072 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:14,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:14,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:14,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:14,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:14,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:44:14,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8 Second operand 8 states. [2018-11-28 23:44:15,001 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 8. Second operand 8 states. Result 117 states and 146 transitions. Complement of second has 18 states. [2018-11-28 23:44:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:44:15,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2018-11-28 23:44:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 11 letters. Loop has 9 letters. [2018-11-28 23:44:15,003 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:15,003 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 20 letters. Loop has 9 letters. [2018-11-28 23:44:15,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:15,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 40 transitions. Stem has 11 letters. Loop has 18 letters. [2018-11-28 23:44:15,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:15,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 146 transitions. [2018-11-28 23:44:15,011 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 23:44:15,018 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 115 states and 144 transitions. [2018-11-28 23:44:15,018 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-28 23:44:15,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-28 23:44:15,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 144 transitions. [2018-11-28 23:44:15,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:15,019 INFO L705 BuchiCegarLoop]: Abstraction has 115 states and 144 transitions. [2018-11-28 23:44:15,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 144 transitions. [2018-11-28 23:44:15,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 73. [2018-11-28 23:44:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-28 23:44:15,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2018-11-28 23:44:15,033 INFO L728 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2018-11-28 23:44:15,033 INFO L608 BuchiCegarLoop]: Abstraction has 73 states and 94 transitions. [2018-11-28 23:44:15,033 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:44:15,033 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 94 transitions. [2018-11-28 23:44:15,034 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-28 23:44:15,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:15,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:15,038 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:15,038 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:44:15,038 INFO L794 eck$LassoCheckResult]: Stem: 1487#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 1486#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 1465#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 1466#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 1467#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 1472#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 1473#L19-1 main_~i~0 := 0; 1474#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1504#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 1512#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 1515#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 1469#L21-3 [2018-11-28 23:44:15,039 INFO L796 eck$LassoCheckResult]: Loop: 1469#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 1483#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1484#L4 assume !(0 == __VERIFIER_assert_~cond); 1488#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 1489#L22-2 assume !(main_~k~0 < main_~j~0); 1480#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 1469#L21-3 [2018-11-28 23:44:15,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 4 times [2018-11-28 23:44:15,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:15,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:15,068 INFO L82 PathProgramCache]: Analyzing trace with hash 2078695422, now seen corresponding path program 1 times [2018-11-28 23:44:15,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:15,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:15,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:15,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1741881747, now seen corresponding path program 2 times [2018-11-28 23:44:15,079 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:15,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:15,234 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:15,234 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:15,234 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:15,235 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:15,235 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:15,235 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,235 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:15,235 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:15,235 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 23:44:15,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:15,236 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:15,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,348 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:15,349 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:15,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:15,373 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:15,373 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:15,402 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:15,421 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:15,422 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=0} Honda state: {ULTIMATE.start_main_~n~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:15,427 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:15,450 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:15,664 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:15,666 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:15,667 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:15,667 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:15,667 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:15,667 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:15,667 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:15,667 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:15,667 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:15,667 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration6_Loop [2018-11-28 23:44:15,667 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:15,668 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:15,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:15,806 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:15,806 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:15,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:15,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:15,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:15,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:15,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:15,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:15,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:15,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:15,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:15,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:15,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:15,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:15,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:15,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:15,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:15,824 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:15,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:15,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:15,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:15,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:15,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:15,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:15,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:15,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:15,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:15,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:15,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:15,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:15,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:15,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:15,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:15,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:15,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:15,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:15,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:15,837 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:15,847 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:44:15,847 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:15,850 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:15,850 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:15,850 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:15,850 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~j~0 + 5*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:44:15,851 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:15,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:15,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:15,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:16,200 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:44:16,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 23:44:16,252 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 77 states and 98 transitions. Complement of second has 5 states. [2018-11-28 23:44:16,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:16,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:44:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:44:16,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:44:16,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:16,254 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:16,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:16,277 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:16,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:16,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:44:16,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 23:44:16,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 77 states and 98 transitions. Complement of second has 5 states. [2018-11-28 23:44:16,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:16,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:44:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2018-11-28 23:44:16,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:44:16,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:16,419 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:16,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:16,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:16,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:16,521 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 4 loop predicates [2018-11-28 23:44:16,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25 Second operand 5 states. [2018-11-28 23:44:16,615 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 94 transitions. cyclomatic complexity: 25. Second operand 5 states. Result 156 states and 196 transitions. Complement of second has 10 states. [2018-11-28 23:44:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:44:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-28 23:44:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-28 23:44:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 17 letters. Loop has 6 letters. [2018-11-28 23:44:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 11 letters. Loop has 12 letters. [2018-11-28 23:44:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:16,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 196 transitions. [2018-11-28 23:44:16,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2018-11-28 23:44:16,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 142 states and 180 transitions. [2018-11-28 23:44:16,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:44:16,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-11-28 23:44:16,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 180 transitions. [2018-11-28 23:44:16,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:16,628 INFO L705 BuchiCegarLoop]: Abstraction has 142 states and 180 transitions. [2018-11-28 23:44:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 180 transitions. [2018-11-28 23:44:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 110. [2018-11-28 23:44:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 23:44:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 144 transitions. [2018-11-28 23:44:16,642 INFO L728 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2018-11-28 23:44:16,643 INFO L608 BuchiCegarLoop]: Abstraction has 110 states and 144 transitions. [2018-11-28 23:44:16,643 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:44:16,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 110 states and 144 transitions. [2018-11-28 23:44:16,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2018-11-28 23:44:16,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:16,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:16,648 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:16,648 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:16,648 INFO L794 eck$LassoCheckResult]: Stem: 2074#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 2073#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 2049#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 2050#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 2051#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 2056#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 2057#L19-1 main_~i~0 := 0; 2052#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2053#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2105#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2106#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2084#L21-3 [2018-11-28 23:44:16,648 INFO L796 eck$LassoCheckResult]: Loop: 2084#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 2080#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2082#L4 assume !(0 == __VERIFIER_assert_~cond); 2075#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2069#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2070#L4 assume !(0 == __VERIFIER_assert_~cond); 2077#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2081#L22-2 assume !(main_~k~0 < main_~j~0); 2066#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2067#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2062#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2063#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2084#L21-3 [2018-11-28 23:44:16,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 5 times [2018-11-28 23:44:16,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:16,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:16,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:16,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:16,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:16,665 INFO L82 PathProgramCache]: Analyzing trace with hash -206190261, now seen corresponding path program 2 times [2018-11-28 23:44:16,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:16,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:16,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:16,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:16,806 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:16,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:16,806 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:16,820 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:44:16,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:44:16,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:16,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:16,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:16,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:16,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-11-28 23:44:16,955 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:44:16,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:44:16,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:44:16,955 INFO L87 Difference]: Start difference. First operand 110 states and 144 transitions. cyclomatic complexity: 38 Second operand 14 states. [2018-11-28 23:44:17,635 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 13 [2018-11-28 23:44:17,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:17,740 INFO L93 Difference]: Finished difference Result 270 states and 328 transitions. [2018-11-28 23:44:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 23:44:17,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 328 transitions. [2018-11-28 23:44:17,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 63 [2018-11-28 23:44:17,748 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 270 states and 328 transitions. [2018-11-28 23:44:17,748 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2018-11-28 23:44:17,748 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-28 23:44:17,748 INFO L73 IsDeterministic]: Start isDeterministic. Operand 270 states and 328 transitions. [2018-11-28 23:44:17,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:17,748 INFO L705 BuchiCegarLoop]: Abstraction has 270 states and 328 transitions. [2018-11-28 23:44:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states and 328 transitions. [2018-11-28 23:44:17,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 166. [2018-11-28 23:44:17,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-28 23:44:17,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 208 transitions. [2018-11-28 23:44:17,759 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 208 transitions. [2018-11-28 23:44:17,759 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 208 transitions. [2018-11-28 23:44:17,759 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:44:17,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 208 transitions. [2018-11-28 23:44:17,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 37 [2018-11-28 23:44:17,763 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:17,763 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:17,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:17,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:17,764 INFO L794 eck$LassoCheckResult]: Stem: 2520#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 2519#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 2493#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 2494#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 2495#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 2500#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 2501#L19-1 main_~i~0 := 0; 2496#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2497#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2560#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2563#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2535#L21-3 [2018-11-28 23:44:17,764 INFO L796 eck$LassoCheckResult]: Loop: 2535#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 2515#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2516#L4 assume !(0 == __VERIFIER_assert_~cond); 2521#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2522#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2533#L4 assume !(0 == __VERIFIER_assert_~cond); 2532#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2531#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 2524#L4 assume !(0 == __VERIFIER_assert_~cond); 2525#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 2530#L22-2 assume !(main_~k~0 < main_~j~0); 2529#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 2528#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 2507#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 2508#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 2535#L21-3 [2018-11-28 23:44:17,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:17,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2088903248, now seen corresponding path program 6 times [2018-11-28 23:44:17,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:17,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:17,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:17,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:17,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash 452506725, now seen corresponding path program 3 times [2018-11-28 23:44:17,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:17,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,781 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:17,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1390681386, now seen corresponding path program 3 times [2018-11-28 23:44:17,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:17,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:17,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:17,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:17,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:17,940 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 23:44:18,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-28 23:44:18,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:18,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:18,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:18,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-28 23:44:18,378 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2018-11-28 23:44:18,565 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 28 [2018-11-28 23:44:18,571 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:18,571 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:18,571 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:18,571 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:18,571 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:18,571 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,572 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:18,572 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:18,572 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-28 23:44:18,572 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:18,572 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:18,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:18,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:18,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:18,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:18,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:18,783 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:18,783 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:18,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:18,793 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:18,794 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:18,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:18,822 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:18,822 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-28 23:44:18,843 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:18,843 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,847 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:18,848 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,868 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:18,868 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:18,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:18,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:19,180 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:19,183 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:19,183 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:19,183 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:19,183 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:19,183 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:19,184 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:19,184 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:19,184 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:19,184 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration8_Loop [2018-11-28 23:44:19,184 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:19,184 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:19,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:19,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:19,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:19,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:19,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:19,385 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:19,385 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:19,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:19,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:19,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:19,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:19,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:19,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:19,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:19,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:19,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:19,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:19,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:19,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:19,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:19,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:19,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:19,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:19,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:19,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:19,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:19,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:19,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:19,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:19,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:19,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:19,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:19,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:19,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44: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 [2018-11-28 23:44:19,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:19,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:19,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:19,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:19,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:19,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:19,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:19,414 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:19,422 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:19,422 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:19,422 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:19,422 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:19,423 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:19,423 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 5 Supporting invariants [] [2018-11-28 23:44:19,423 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:19,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:19,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:19,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:19,866 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 23:44:19,866 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 208 transitions. cyclomatic complexity: 46 Second operand 10 states. [2018-11-28 23:44:20,435 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 208 transitions. cyclomatic complexity: 46. Second operand 10 states. Result 672 states and 840 transitions. Complement of second has 32 states. [2018-11-28 23:44:20,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 1 stem states 15 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-28 23:44:20,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 11 letters. Loop has 15 letters. [2018-11-28 23:44:20,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:20,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 26 letters. Loop has 15 letters. [2018-11-28 23:44:20,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:20,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 62 transitions. Stem has 11 letters. Loop has 30 letters. [2018-11-28 23:44:20,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:20,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 672 states and 840 transitions. [2018-11-28 23:44:20,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 79 [2018-11-28 23:44:20,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 672 states to 504 states and 629 transitions. [2018-11-28 23:44:20,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-11-28 23:44:20,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-28 23:44:20,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 629 transitions. [2018-11-28 23:44:20,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:20,449 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 629 transitions. [2018-11-28 23:44:20,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 629 transitions. [2018-11-28 23:44:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 262. [2018-11-28 23:44:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-11-28 23:44:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 333 transitions. [2018-11-28 23:44:20,460 INFO L728 BuchiCegarLoop]: Abstraction has 262 states and 333 transitions. [2018-11-28 23:44:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 23:44:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-11-28 23:44:20,461 INFO L87 Difference]: Start difference. First operand 262 states and 333 transitions. Second operand 12 states. [2018-11-28 23:44:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:20,665 INFO L93 Difference]: Finished difference Result 338 states and 425 transitions. [2018-11-28 23:44:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 23:44:20,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 338 states and 425 transitions. [2018-11-28 23:44:20,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-28 23:44:20,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 338 states to 282 states and 357 transitions. [2018-11-28 23:44:20,673 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-11-28 23:44:20,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2018-11-28 23:44:20,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 282 states and 357 transitions. [2018-11-28 23:44:20,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:20,675 INFO L705 BuchiCegarLoop]: Abstraction has 282 states and 357 transitions. [2018-11-28 23:44:20,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states and 357 transitions. [2018-11-28 23:44:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2018-11-28 23:44:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-11-28 23:44:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 351 transitions. [2018-11-28 23:44:20,683 INFO L728 BuchiCegarLoop]: Abstraction has 278 states and 351 transitions. [2018-11-28 23:44:20,683 INFO L608 BuchiCegarLoop]: Abstraction has 278 states and 351 transitions. [2018-11-28 23:44:20,683 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:44:20,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 278 states and 351 transitions. [2018-11-28 23:44:20,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2018-11-28 23:44:20,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:20,688 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:20,690 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:20,690 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1, 1] [2018-11-28 23:44:20,690 INFO L794 eck$LassoCheckResult]: Stem: 4204#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 4203#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 4180#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 4181#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 4186#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 4195#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 4196#L19-1 main_~i~0 := 0; 4182#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4183#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 4376#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4374#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4274#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4273#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4268#L4 assume !(0 == __VERIFIER_assert_~cond); 4269#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4264#L22-2 assume !(main_~k~0 < main_~j~0); 4265#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4272#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 4250#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 4251#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 4220#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4200#L22-2 [2018-11-28 23:44:20,693 INFO L796 eck$LassoCheckResult]: Loop: 4200#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4201#L4 assume !(0 == __VERIFIER_assert_~cond); 4209#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4222#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 4223#L4 assume !(0 == __VERIFIER_assert_~cond); 4205#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 4206#L22-2 assume !(main_~k~0 < main_~j~0); 4197#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 4198#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 4200#L22-2 [2018-11-28 23:44:20,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:20,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1550826094, now seen corresponding path program 4 times [2018-11-28 23:44:20,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:20,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:20,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,696 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:20,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:20,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1734754794, now seen corresponding path program 2 times [2018-11-28 23:44:20,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:20,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:20,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:20,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:20,727 INFO L82 PathProgramCache]: Analyzing trace with hash 538979237, now seen corresponding path program 5 times [2018-11-28 23:44:20,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:20,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:20,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:20,917 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:20,917 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:20,918 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:20,918 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:20,918 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:20,918 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:20,918 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:20,919 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:20,919 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-28 23:44:20,919 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:20,919 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:20,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:20,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:20,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:20,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:20,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:20,999 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:21,003 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:21,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:21,006 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:21,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:21,032 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:21,032 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:21,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:21,057 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:21,058 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:21,079 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,103 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:21,103 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:21,463 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:21,466 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:21,466 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:21,466 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:21,466 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:21,466 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:21,466 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:21,466 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:21,466 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:21,466 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration9_Loop [2018-11-28 23:44:21,467 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:21,467 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:21,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:21,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:21,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:21,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:21,566 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:21,567 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:21,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:21,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:21,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:21,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:21,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:21,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:21,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:21,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:21,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:21,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:21,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:21,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:21,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:21,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:21,571 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:21,571 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:21,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:21,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:21,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:21,573 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:21,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:21,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:21,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:21,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:21,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:21,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:21,581 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:21,590 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:21,590 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:21,591 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:21,591 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:21,591 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:21,591 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 3*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:21,591 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:21,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:44:21,685 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:21,685 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 23:44:21,712 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 292 states and 365 transitions. Complement of second has 7 states. [2018-11-28 23:44:21,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:21,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 23:44:21,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:21,725 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:21,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:44:21,796 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:21,796 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 23:44:21,824 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 292 states and 365 transitions. Complement of second has 7 states. [2018-11-28 23:44:21,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:21,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:21,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 23:44:21,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:21,831 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:21,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:21,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 23:44:21,886 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:21,886 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82 Second operand 4 states. [2018-11-28 23:44:21,924 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 278 states and 351 transitions. cyclomatic complexity: 82. Second operand 4 states. Result 503 states and 601 transitions. Complement of second has 6 states. [2018-11-28 23:44:21,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2018-11-28 23:44:21,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 9 letters. [2018-11-28 23:44:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 30 letters. Loop has 9 letters. [2018-11-28 23:44:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:21,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 23:44:21,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:21,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 503 states and 601 transitions. [2018-11-28 23:44:21,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-11-28 23:44:21,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 503 states to 383 states and 465 transitions. [2018-11-28 23:44:21,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2018-11-28 23:44:21,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2018-11-28 23:44:21,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 465 transitions. [2018-11-28 23:44:21,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:21,935 INFO L705 BuchiCegarLoop]: Abstraction has 383 states and 465 transitions. [2018-11-28 23:44:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 465 transitions. [2018-11-28 23:44:21,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 324. [2018-11-28 23:44:21,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-28 23:44:21,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 393 transitions. [2018-11-28 23:44:21,942 INFO L728 BuchiCegarLoop]: Abstraction has 324 states and 393 transitions. [2018-11-28 23:44:21,942 INFO L608 BuchiCegarLoop]: Abstraction has 324 states and 393 transitions. [2018-11-28 23:44:21,942 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:44:21,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 324 states and 393 transitions. [2018-11-28 23:44:21,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2018-11-28 23:44:21,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:21,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:21,945 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:21,945 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:21,946 INFO L794 eck$LassoCheckResult]: Stem: 5884#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 5883#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 5856#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 5857#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 5862#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 5872#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 5873#L19-1 main_~i~0 := 0; 5858#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5859#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 6001#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5941#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5942#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5946#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5940#L4 assume !(0 == __VERIFIER_assert_~cond); 5937#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5936#L22-2 assume !(main_~k~0 < main_~j~0); 5934#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5931#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 5928#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5929#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5898#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5878#L22-2 [2018-11-28 23:44:21,946 INFO L796 eck$LassoCheckResult]: Loop: 5878#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5880#L4 assume !(0 == __VERIFIER_assert_~cond); 5885#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5886#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5897#L4 assume !(0 == __VERIFIER_assert_~cond); 5896#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5895#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5894#L4 assume !(0 == __VERIFIER_assert_~cond); 5893#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5892#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 5890#L4 assume !(0 == __VERIFIER_assert_~cond); 5891#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 5889#L22-2 assume !(main_~k~0 < main_~j~0); 5874#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 5875#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 5868#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 5869#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 5900#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 5878#L22-2 [2018-11-28 23:44:21,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1550826094, now seen corresponding path program 6 times [2018-11-28 23:44:21,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:21,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:21,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:21,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1362433097, now seen corresponding path program 4 times [2018-11-28 23:44:21,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:21,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:21,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:21,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:21,972 INFO L82 PathProgramCache]: Analyzing trace with hash -130724088, now seen corresponding path program 7 times [2018-11-28 23:44:21,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:21,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:21,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:21,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-28 23:44:22,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:22,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:22,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:22,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:22,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:22,282 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 41 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-28 23:44:22,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:22,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 14 [2018-11-28 23:44:22,454 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-28 23:44:22,636 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 34 [2018-11-28 23:44:22,659 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:22,659 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:22,660 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:22,660 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:22,660 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:22,660 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:22,660 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:22,660 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:22,660 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration10_Loop [2018-11-28 23:44:22,660 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:22,660 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:22,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:22,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:22,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:22,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:22,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:22,787 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:22,787 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:22,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:22,792 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:22,816 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:22,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:23,287 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:23,290 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:23,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:23,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:23,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:23,290 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:23,290 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:23,290 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:23,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:23,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration10_Loop [2018-11-28 23:44:23,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:23,291 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:23,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:23,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:23,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:23,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:23,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:23,436 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:23,437 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:23,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:23,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:23,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:23,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:23,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:23,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:23,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:23,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:23,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:23,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:23,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:23,441 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:23,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:23,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:23,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:23,442 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:23,442 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:23,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:23,449 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:44:23,450 INFO L444 ModelExtractionUtils]: 1 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:23,450 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:23,450 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:23,450 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:23,450 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~k~0 - 15*ULTIMATE.start_main_~i~0 + 7*ULTIMATE.start_main_~j~0 Supporting invariants [] [2018-11-28 23:44:23,451 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:23,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:23,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:23,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:24,016 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 23:44:24,016 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 23:44:24,418 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 358 states and 429 transitions. Complement of second has 7 states. [2018-11-28 23:44:24,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:24,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:44:24,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 23:44:24,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:24,420 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:24,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:24,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:24,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:24,617 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 23:44:24,617 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 23:44:24,663 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 358 states and 429 transitions. Complement of second has 7 states. [2018-11-28 23:44:24,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:24,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:44:24,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 23:44:24,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:24,665 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:24,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:24,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:24,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:24,952 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 8 loop predicates [2018-11-28 23:44:24,952 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 23:44:31,330 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 1642 states and 1875 transitions. Complement of second has 47 states. [2018-11-28 23:44:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2018-11-28 23:44:31,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 42 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 23:44:31,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:31,332 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:31,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:31,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:31,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:32,045 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 8 loop predicates [2018-11-28 23:44:32,046 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78 Second operand 10 states. [2018-11-28 23:44:36,180 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 324 states and 393 transitions. cyclomatic complexity: 78. Second operand 10 states. Result 1923 states and 2199 transitions. Complement of second has 51 states. [2018-11-28 23:44:36,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:44:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 47 transitions. [2018-11-28 23:44:36,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 21 letters. Loop has 18 letters. [2018-11-28 23:44:36,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:36,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 39 letters. Loop has 18 letters. [2018-11-28 23:44:36,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:36,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 47 transitions. Stem has 21 letters. Loop has 36 letters. [2018-11-28 23:44:36,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:36,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1923 states and 2199 transitions. [2018-11-28 23:44:36,206 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2018-11-28 23:44:36,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1923 states to 872 states and 1050 transitions. [2018-11-28 23:44:36,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2018-11-28 23:44:36,212 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2018-11-28 23:44:36,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 872 states and 1050 transitions. [2018-11-28 23:44:36,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:36,213 INFO L705 BuchiCegarLoop]: Abstraction has 872 states and 1050 transitions. [2018-11-28 23:44:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states and 1050 transitions. [2018-11-28 23:44:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 376. [2018-11-28 23:44:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-11-28 23:44:36,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 456 transitions. [2018-11-28 23:44:36,226 INFO L728 BuchiCegarLoop]: Abstraction has 376 states and 456 transitions. [2018-11-28 23:44:36,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 23:44:36,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-28 23:44:36,230 INFO L87 Difference]: Start difference. First operand 376 states and 456 transitions. Second operand 14 states. [2018-11-28 23:44:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:36,873 INFO L93 Difference]: Finished difference Result 1193 states and 1375 transitions. [2018-11-28 23:44:36,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 23:44:36,875 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1193 states and 1375 transitions. [2018-11-28 23:44:36,883 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 82 [2018-11-28 23:44:36,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1193 states to 504 states and 594 transitions. [2018-11-28 23:44:36,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-28 23:44:36,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-28 23:44:36,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 594 transitions. [2018-11-28 23:44:36,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:36,888 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 594 transitions. [2018-11-28 23:44:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 594 transitions. [2018-11-28 23:44:36,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 248. [2018-11-28 23:44:36,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-11-28 23:44:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 293 transitions. [2018-11-28 23:44:36,899 INFO L728 BuchiCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-11-28 23:44:36,899 INFO L608 BuchiCegarLoop]: Abstraction has 248 states and 293 transitions. [2018-11-28 23:44:36,900 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:44:36,900 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 248 states and 293 transitions. [2018-11-28 23:44:36,903 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2018-11-28 23:44:36,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:36,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:36,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:36,905 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 2, 2, 2, 1, 1, 1] [2018-11-28 23:44:36,907 INFO L794 eck$LassoCheckResult]: Stem: 12857#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 12856#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 12836#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 12837#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 12842#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 12848#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 12849#L19-1 main_~i~0 := 0; 12850#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12864#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12846#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12838#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12839#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12843#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12885#L4 assume !(0 == __VERIFIER_assert_~cond); 12884#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12883#L22-2 assume !(main_~k~0 < main_~j~0); 12882#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12881#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12879#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12875#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12871#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12872#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12949#L4 assume !(0 == __VERIFIER_assert_~cond); 12948#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12917#L22-2 assume !(main_~k~0 < main_~j~0); 12913#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12905#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12904#L22-2 [2018-11-28 23:44:36,907 INFO L796 eck$LassoCheckResult]: Loop: 12904#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12903#L4 assume !(0 == __VERIFIER_assert_~cond); 12863#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12902#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12901#L4 assume !(0 == __VERIFIER_assert_~cond); 12900#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12899#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12898#L4 assume !(0 == __VERIFIER_assert_~cond); 12897#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12896#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12894#L4 assume !(0 == __VERIFIER_assert_~cond); 12895#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12893#L22-2 assume !(main_~k~0 < main_~j~0); 12892#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12891#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 12880#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 12878#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 12873#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12874#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 12929#L4 assume !(0 == __VERIFIER_assert_~cond); 12923#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 12924#L22-2 assume !(main_~k~0 < main_~j~0); 12913#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 12905#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 12904#L22-2 [2018-11-28 23:44:36,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:36,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1172406517, now seen corresponding path program 8 times [2018-11-28 23:44:36,908 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:36,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:36,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-28 23:44:37,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:37,221 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:37,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:44:37,260 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:44:37,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:37,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:37,351 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:44:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:37,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 13 [2018-11-28 23:44:37,371 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:44:37,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1833842522, now seen corresponding path program 5 times [2018-11-28 23:44:37,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:37,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:37,481 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 23:44:37,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:37,481 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:37,493 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:44:37,520 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 23:44:37,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:37,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-28 23:44:37,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:37,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-28 23:44:37,612 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:44:37,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-28 23:44:37,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-28 23:44:37,613 INFO L87 Difference]: Start difference. First operand 248 states and 293 transitions. cyclomatic complexity: 50 Second operand 11 states. [2018-11-28 23:44:37,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:37,728 INFO L93 Difference]: Finished difference Result 257 states and 293 transitions. [2018-11-28 23:44:37,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 23:44:37,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 257 states and 293 transitions. [2018-11-28 23:44:37,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2018-11-28 23:44:37,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 257 states to 196 states and 220 transitions. [2018-11-28 23:44:37,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-28 23:44:37,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-28 23:44:37,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 220 transitions. [2018-11-28 23:44:37,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:37,735 INFO L705 BuchiCegarLoop]: Abstraction has 196 states and 220 transitions. [2018-11-28 23:44:37,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 220 transitions. [2018-11-28 23:44:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 181. [2018-11-28 23:44:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-28 23:44:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 205 transitions. [2018-11-28 23:44:37,743 INFO L728 BuchiCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-11-28 23:44:37,743 INFO L608 BuchiCegarLoop]: Abstraction has 181 states and 205 transitions. [2018-11-28 23:44:37,743 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:44:37,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 181 states and 205 transitions. [2018-11-28 23:44:37,748 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2018-11-28 23:44:37,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:37,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:37,749 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:37,749 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:44:37,750 INFO L794 eck$LassoCheckResult]: Stem: 13543#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 13542#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 13519#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 13520#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 13525#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 13533#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 13534#L19-1 main_~i~0 := 0; 13535#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13551#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 13530#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13521#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13522#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13581#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13580#L4 assume !(0 == __VERIFIER_assert_~cond); 13578#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13575#L22-2 assume !(main_~k~0 < main_~j~0); 13573#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13571#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 13569#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 13566#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 13564#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13538#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13539#L4 assume !(0 == __VERIFIER_assert_~cond); 13685#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13684#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13683#L4 assume !(0 == __VERIFIER_assert_~cond); 13682#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13558#L22-2 assume !(main_~k~0 < main_~j~0); 13557#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 13556#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 13554#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13552#L4 [2018-11-28 23:44:37,750 INFO L796 eck$LassoCheckResult]: Loop: 13552#L4 assume !(0 == __VERIFIER_assert_~cond); 13544#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 13545#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 13552#L4 [2018-11-28 23:44:37,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -471512789, now seen corresponding path program 9 times [2018-11-28 23:44:37,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:37,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,777 INFO L82 PathProgramCache]: Analyzing trace with hash 84523, now seen corresponding path program 1 times [2018-11-28 23:44:37,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:37,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:37,787 INFO L82 PathProgramCache]: Analyzing trace with hash 2000582849, now seen corresponding path program 10 times [2018-11-28 23:44:37,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:37,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:37,870 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:37,870 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:37,870 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:37,870 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:37,870 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:37,871 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:37,871 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:37,871 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:37,871 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration12_Loop [2018-11-28 23:44:37,871 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:37,871 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:37,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:37,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,053 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:44:38,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:38,055 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:38,059 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:38,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:38,061 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 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,081 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:38,082 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:38,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:38,989 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:38,991 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:38,991 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:38,991 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:38,992 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:38,992 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:38,992 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:38,992 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:38,992 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:38,992 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration12_Loop [2018-11-28 23:44:38,992 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:38,992 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:38,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:38,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:39,237 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-11-28 23:44:39,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:39,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:39,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:39,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:39,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:39,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:39,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:39,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:39,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:39,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:39,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:39,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:39,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:39,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:39,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:39,242 INFO L206 nArgumentSynthesizer]: 4 loop disjuncts [2018-11-28 23:44:39,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:39,243 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:44:39,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:39,262 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:39,268 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:39,269 INFO L444 ModelExtractionUtils]: 4 out of 8 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:39,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:39,271 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:39,271 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:39,271 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~k~0) = 1*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~k~0 Supporting invariants [] [2018-11-28 23:44:39,271 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:39,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:39,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:39,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:39,740 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:39,740 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 23:44:40,051 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 187 states and 211 transitions. Complement of second has 7 states. [2018-11-28 23:44:40,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:40,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 23:44:40,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,054 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:40,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:40,256 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:40,256 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 23:44:40,270 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 187 states and 211 transitions. Complement of second has 7 states. [2018-11-28 23:44:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:40,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:40,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-11-28 23:44:40,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 23:44:40,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,273 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:44:40,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:44:40,312 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:44:40,312 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28 Second operand 4 states. [2018-11-28 23:44:40,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 181 states and 205 transitions. cyclomatic complexity: 28. Second operand 4 states. Result 292 states and 322 transitions. Complement of second has 6 states. [2018-11-28 23:44:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:40,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:44:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2018-11-28 23:44:40,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-28 23:44:40,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-28 23:44:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 31 letters. Loop has 6 letters. [2018-11-28 23:44:40,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:40,340 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 292 states and 322 transitions. [2018-11-28 23:44:40,347 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-28 23:44:40,349 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 292 states to 194 states and 215 transitions. [2018-11-28 23:44:40,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-28 23:44:40,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-28 23:44:40,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 215 transitions. [2018-11-28 23:44:40,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:40,353 INFO L705 BuchiCegarLoop]: Abstraction has 194 states and 215 transitions. [2018-11-28 23:44:40,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 215 transitions. [2018-11-28 23:44:40,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 170. [2018-11-28 23:44:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-28 23:44:40,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 191 transitions. [2018-11-28 23:44:40,359 INFO L728 BuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-11-28 23:44:40,359 INFO L608 BuchiCegarLoop]: Abstraction has 170 states and 191 transitions. [2018-11-28 23:44:40,359 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:44:40,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 191 transitions. [2018-11-28 23:44:40,360 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-11-28 23:44:40,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:40,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:40,366 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:40,366 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 6, 2, 2, 2, 1, 1, 1] [2018-11-28 23:44:40,366 INFO L794 eck$LassoCheckResult]: Stem: 14734#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 14733#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 14713#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 14714#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 14715#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 14720#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 14721#L19-1 main_~i~0 := 0; 14722#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14741#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14725#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14716#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14717#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14723#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14778#L4 assume !(0 == __VERIFIER_assert_~cond); 14776#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14774#L22-2 assume !(main_~k~0 < main_~j~0); 14772#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14770#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14768#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14764#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14762#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14761#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14760#L4 assume !(0 == __VERIFIER_assert_~cond); 14759#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14758#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14749#L4 assume !(0 == __VERIFIER_assert_~cond); 14747#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14745#L22-2 assume !(main_~k~0 < main_~j~0); 14744#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14743#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14742#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14737#L4 [2018-11-28 23:44:40,366 INFO L796 eck$LassoCheckResult]: Loop: 14737#L4 assume !(0 == __VERIFIER_assert_~cond); 14738#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14797#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14796#L4 assume !(0 == __VERIFIER_assert_~cond); 14795#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14794#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14793#L4 assume !(0 == __VERIFIER_assert_~cond); 14781#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14782#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14780#L4 assume !(0 == __VERIFIER_assert_~cond); 14779#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14777#L22-2 assume !(main_~k~0 < main_~j~0); 14775#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14773#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 14771#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 14769#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 14767#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14763#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14731#L4 assume !(0 == __VERIFIER_assert_~cond); 14754#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14750#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14751#L4 assume !(0 == __VERIFIER_assert_~cond); 14747#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 14745#L22-2 assume !(main_~k~0 < main_~j~0); 14744#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 14743#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 14742#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 14737#L4 [2018-11-28 23:44:40,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash -471512789, now seen corresponding path program 11 times [2018-11-28 23:44:40,367 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:40,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:40,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:40,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash 535168542, now seen corresponding path program 6 times [2018-11-28 23:44:40,396 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:40,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:40,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:40,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:40,422 INFO L82 PathProgramCache]: Analyzing trace with hash 306598580, now seen corresponding path program 12 times [2018-11-28 23:44:40,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:40,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:40,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 73 proven. 69 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-28 23:44:40,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:40,624 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:40,635 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-28 23:44:40,659 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-28 23:44:40,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:40,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:40,824 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 126 proven. 52 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-11-28 23:44:40,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:40,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 20 [2018-11-28 23:44:41,140 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-28 23:44:41,158 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-28 23:44:41,787 WARN L180 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 39 [2018-11-28 23:44:41,789 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:41,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:41,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:41,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:41,789 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:41,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:41,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:41,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:41,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration13_Loop [2018-11-28 23:44:41,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:41,790 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:41,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:41,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:41,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:41,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:41,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:41,938 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:41,938 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:41,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:41,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:41,948 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:41,949 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Honda state: {ULTIMATE.start___VERIFIER_assert_~cond=1, ULTIMATE.start___VERIFIER_assert_#in~cond=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:41,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:41,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:41,974 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:41,974 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post4=0} Honda state: {ULTIMATE.start_main_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:41,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:41,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:41,999 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:41,999 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 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:42,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:42,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:42,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:42,025 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:42,046 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:42,046 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:42,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:42,069 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:42,425 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:42,427 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:42,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:42,427 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:42,427 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:42,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:42,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:42,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:42,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:42,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration13_Loop [2018-11-28 23:44:42,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:42,428 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:42,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:42,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:42,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:42,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:42,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:42,577 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:42,577 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:42,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:42,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:42,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:42,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:42,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:42,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:42,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:42,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:42,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:42,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:42,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:42,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:42,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:42,582 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:44:42,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:42,583 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:44:42,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:42,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:42,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:42,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:42,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:42,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:42,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:42,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:42,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:42,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:42,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:42,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:42,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:42,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:42,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:42,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:42,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:42,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:42,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:42,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:44:42,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:42,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:42,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:42,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:42,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:42,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:42,591 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:42,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:42,594 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:42,596 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:44:42,596 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:44:42,597 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:42,597 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:42,597 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:42,597 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 3 Supporting invariants [] [2018-11-28 23:44:42,597 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:42,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:42,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:42,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-28 23:44:42,912 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:44:42,912 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 170 states and 191 transitions. cyclomatic complexity: 24 Second operand 9 states. [2018-11-28 23:44:43,056 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 170 states and 191 transitions. cyclomatic complexity: 24. Second operand 9 states. Result 628 states and 713 transitions. Complement of second has 14 states. [2018-11-28 23:44:43,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:44:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2018-11-28 23:44:43,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 31 letters. Loop has 27 letters. [2018-11-28 23:44:43,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:43,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 58 letters. Loop has 27 letters. [2018-11-28 23:44:43,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:43,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 42 transitions. Stem has 31 letters. Loop has 54 letters. [2018-11-28 23:44:43,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:43,060 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 628 states and 713 transitions. [2018-11-28 23:44:43,066 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2018-11-28 23:44:43,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 628 states to 495 states and 562 transitions. [2018-11-28 23:44:43,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-28 23:44:43,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-28 23:44:43,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 562 transitions. [2018-11-28 23:44:43,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:43,075 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 562 transitions. [2018-11-28 23:44:43,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 562 transitions. [2018-11-28 23:44:43,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 329. [2018-11-28 23:44:43,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-28 23:44:43,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 380 transitions. [2018-11-28 23:44:43,085 INFO L728 BuchiCegarLoop]: Abstraction has 329 states and 380 transitions. [2018-11-28 23:44:43,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 23:44:43,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2018-11-28 23:44:43,089 INFO L87 Difference]: Start difference. First operand 329 states and 380 transitions. Second operand 20 states. [2018-11-28 23:44:44,171 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-11-28 23:44:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:45,216 INFO L93 Difference]: Finished difference Result 608 states and 654 transitions. [2018-11-28 23:44:45,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-28 23:44:45,218 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 608 states and 654 transitions. [2018-11-28 23:44:45,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-28 23:44:45,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 608 states to 150 states and 161 transitions. [2018-11-28 23:44:45,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:44:45,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:44:45,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 161 transitions. [2018-11-28 23:44:45,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:44:45,224 INFO L705 BuchiCegarLoop]: Abstraction has 150 states and 161 transitions. [2018-11-28 23:44:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 161 transitions. [2018-11-28 23:44:45,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2018-11-28 23:44:45,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-28 23:44:45,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2018-11-28 23:44:45,232 INFO L728 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-28 23:44:45,233 INFO L608 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2018-11-28 23:44:45,233 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:44:45,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 133 transitions. [2018-11-28 23:44:45,233 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-11-28 23:44:45,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:44:45,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:44:45,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 9, 9, 5, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:44:45,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 2, 2, 2, 1, 1, 1] [2018-11-28 23:44:45,237 INFO L794 eck$LassoCheckResult]: Stem: 16940#ULTIMATE.startENTRY ~__BLAST_NONDET~0 := 0; 16939#L-1 havoc main_#res;havoc main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~post6, main_#t~post5, main_#t~post4, main_~i~0, main_~j~0, main_~k~0, main_~n~0, main_~l~0, main_~m~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~n~0;havoc main_~l~0;havoc main_~m~0;main_~n~0 := main_#t~nondet1;havoc main_#t~nondet1;main_~m~0 := main_#t~nondet2;havoc main_#t~nondet2;main_~l~0 := main_#t~nondet3;havoc main_#t~nondet3; 16919#L16 assume !!(-1000000 < main_~n~0 && main_~n~0 < 1000000); 16920#L17 assume !!(-1000000 < main_~m~0 && main_~m~0 < 1000000); 16925#L18 assume !!(-1000000 < main_~l~0 && main_~l~0 < 1000000); 16931#L19 assume 3 * main_~n~0 <= main_~m~0 + main_~l~0; 16932#L19-1 main_~i~0 := 0; 16933#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16946#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16926#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16921#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16922#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16929#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16991#L4 assume !(0 == __VERIFIER_assert_~cond); 16992#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16986#L22-2 assume !(main_~k~0 < main_~j~0); 16987#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16980#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16981#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16923#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16924#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16930#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16938#L4 assume !(0 == __VERIFIER_assert_~cond); 16941#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16942#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17021#L4 assume !(0 == __VERIFIER_assert_~cond); 17019#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 17017#L22-2 assume !(main_~k~0 < main_~j~0); 16934#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16935#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 17024#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17005#L4 assume !(0 == __VERIFIER_assert_~cond); 17023#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 17022#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 17020#L4 assume !(0 == __VERIFIER_assert_~cond); 17018#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16988#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16985#L4 assume !(0 == __VERIFIER_assert_~cond); 16982#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16979#L22-2 assume !(main_~k~0 < main_~j~0); 16978#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16958#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16957#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16955#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16953#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16936#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16937#L4 assume !(0 == __VERIFIER_assert_~cond); 16961#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16960#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16959#L4 assume !(0 == __VERIFIER_assert_~cond); 16952#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16954#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16951#L4 assume !(0 == __VERIFIER_assert_~cond); 16950#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16949#L22-2 assume !(main_~k~0 < main_~j~0); 16948#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16947#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16945#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16943#L4 [2018-11-28 23:44:45,237 INFO L796 eck$LassoCheckResult]: Loop: 16943#L4 assume !(0 == __VERIFIER_assert_~cond); 16944#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16977#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16976#L4 assume !(0 == __VERIFIER_assert_~cond); 16975#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16974#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16973#L4 assume !(0 == __VERIFIER_assert_~cond); 16971#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16972#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16970#L4 assume !(0 == __VERIFIER_assert_~cond); 16969#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16968#L22-2 assume !(main_~k~0 < main_~j~0); 16967#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16966#L21-3 assume !(main_~j~0 < 3 * main_~i~0); 16965#L20-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 16964#L20-3 assume !!(main_~i~0 < main_~n~0);main_~j~0 := 2 * main_~i~0; 16963#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16962#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16937#L4 assume !(0 == __VERIFIER_assert_~cond); 16961#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16960#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16959#L4 assume !(0 == __VERIFIER_assert_~cond); 16952#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16954#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16951#L4 assume !(0 == __VERIFIER_assert_~cond); 16950#L4-2 main_#t~post6 := main_~k~0;main_~k~0 := 1 + main_#t~post6;havoc main_#t~post6; 16949#L22-2 assume !(main_~k~0 < main_~j~0); 16948#L21-2 main_#t~post5 := main_~j~0;main_~j~0 := 1 + main_#t~post5;havoc main_#t~post5; 16947#L21-3 assume !!(main_~j~0 < 3 * main_~i~0);main_~k~0 := main_~i~0; 16945#L22-2 assume !!(main_~k~0 < main_~j~0);__VERIFIER_assert_#in~cond := (if main_~k~0 - main_~i~0 <= 2 * main_~n~0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 16943#L4 [2018-11-28 23:44:45,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:45,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1793586952, now seen corresponding path program 13 times [2018-11-28 23:44:45,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:45,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:45,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:44:45,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:45,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:45,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1850955272, now seen corresponding path program 7 times [2018-11-28 23:44:45,280 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:45,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:45,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:44:45,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:45,300 INFO L82 PathProgramCache]: Analyzing trace with hash 915310287, now seen corresponding path program 14 times [2018-11-28 23:44:45,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:44:45,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:44:45,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:44:45,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:44:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 279 proven. 171 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-11-28 23:44:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:44:45,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 23:44:45,494 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 23:44:45,532 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 23:44:45,532 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:44:45,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 433 proven. 48 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2018-11-28 23:44:45,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:44:45,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2018-11-28 23:44:46,032 WARN L180 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 106 [2018-11-28 23:44:46,033 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 23:44:47,098 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 39 [2018-11-28 23:44:47,100 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:47,101 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:47,101 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:47,101 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:47,101 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:44:47,101 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:47,101 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:47,101 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:47,101 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration14_Loop [2018-11-28 23:44:47,101 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:47,101 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:47,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,245 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:47,245 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:47,257 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:47,257 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:47,260 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:44:47,260 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post5=0} Honda state: {ULTIMATE.start_main_#t~post5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:47,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:44:47,283 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:47,309 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:44:47,310 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:44:47,675 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:44:47,677 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:44:47,678 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:44:47,678 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:44:47,678 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:44:47,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:44:47,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:44:47,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:44:47,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:44:47,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: nested9_true-unreach-call_true-termination.i_Iteration14_Loop [2018-11-28 23:44:47,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:44:47,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:44:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:44:47,855 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:44:47,855 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:44:47,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:44:47,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:44:47,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:44:47,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:44:47,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:44:47,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:44:47,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:44:47,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:44:47,868 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:44:47,874 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:44:47,875 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:44:47,876 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:44:47,876 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:44:47,876 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:44:47,876 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 11*ULTIMATE.start_main_~n~0 - 8*ULTIMATE.start_main_~i~0 Supporting invariants [] [2018-11-28 23:44:47,876 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:44:47,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:44:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:47,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:44:47,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:44:48,114 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 52 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-28 23:44:48,115 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:44:48,115 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 122 states and 133 transitions. cyclomatic complexity: 15 Second operand 9 states. [2018-11-28 23:44:48,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 122 states and 133 transitions. cyclomatic complexity: 15. Second operand 9 states. Result 232 states and 254 transitions. Complement of second has 10 states. [2018-11-28 23:44:48,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:44:48,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:44:48,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-11-28 23:44:48,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 58 letters. Loop has 30 letters. [2018-11-28 23:44:48,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:48,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 88 letters. Loop has 30 letters. [2018-11-28 23:44:48,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:48,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 58 letters. Loop has 60 letters. [2018-11-28 23:44:48,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:44:48,257 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 232 states and 254 transitions. [2018-11-28 23:44:48,262 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:48,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 232 states to 0 states and 0 transitions. [2018-11-28 23:44:48,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:48,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:48,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:48,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:48,262 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:48,262 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-28 23:44:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-28 23:44:48,266 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 15 states. [2018-11-28 23:44:48,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:44:48,266 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-28 23:44:48,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-28 23:44:48,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-28 23:44:48,267 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:48,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 23:44:48,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:44:48,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:44:48,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:44:48,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:44:48,268 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:48,268 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:48,268 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:44:48,268 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:44:48,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:44:48,268 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:44:48,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:44:48,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:44:48 BoogieIcfgContainer [2018-11-28 23:44:48,276 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:44:48,276 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:44:48,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:44:48,277 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:44:48,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:44:07" (3/4) ... [2018-11-28 23:44:48,281 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:44:48,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:44:48,282 INFO L168 Benchmark]: Toolchain (without parser) took 42101.76 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 340.8 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -73.0 MB). Peak memory consumption was 267.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:48,283 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:48,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:48,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:48,285 INFO L168 Benchmark]: Boogie Preprocessor took 33.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:48,285 INFO L168 Benchmark]: RCFGBuilder took 512.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:48,286 INFO L168 Benchmark]: BuchiAutomizer took 41188.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:44:48,286 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:44:48,290 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.05 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.42 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.75 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 512.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -144.3 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 41188.58 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 228.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.5 MB). Peak memory consumption was 288.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 20 terminating modules (9 trivial, 6 deterministic, 5 nondeterministic). One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 10 locations. One deterministic module has affine ranking function -2 * i + 5 and consists of 17 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 8 locations. One deterministic module has affine ranking function 11 * n + -8 * i and consists of 6 locations. One nondeterministic module has affine ranking function 2 * i + -1 * j and consists of 5 locations. One nondeterministic module has affine ranking function -2 * j + 5 * i and consists of 6 locations. One nondeterministic module has affine ranking function 3 * i + -1 * j and consists of 4 locations. One nondeterministic module has affine ranking function -2 * k + -15 * i + 7 * j and consists of 13 locations. One nondeterministic module has affine ranking function j + -1 * k and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 41.1s and 15 iterations. TraceHistogramMax:10. Analysis of lassos took 17.0s. Construction of modules took 13.0s. Büchi inclusion checks took 10.4s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 1544 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 324 states and ocurred in iteration 9. Nontrivial modules had stage [6, 0, 4, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 144/189 HoareTripleCheckerStatistics: 398 SDtfs, 790 SDslu, 487 SDs, 0 SdLazy, 1722 SolverSat, 324 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 13.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT5 conc0 concLT6 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf98 lsp89 ukn100 mio100 lsp100 div100 bol100 ite103 ukn100 eq144 hnf94 smp96 dnf114 smp100 tf104 neg99 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 30ms VariablesStem: 0 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 0 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 11 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...