./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0baccb6c9a05802d446420fb16b8e65dc76eab5e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 02:21:57,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:21:57,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:21:57,155 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:21:57,156 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:21:57,157 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:21:57,158 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:21:57,160 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:21:57,162 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:21:57,162 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:21:57,163 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:21:57,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:21:57,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:21:57,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:21:57,167 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:21:57,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:21:57,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:21:57,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:21:57,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:21:57,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:21:57,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:21:57,177 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:21:57,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:21:57,180 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:21:57,180 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:21:57,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:21:57,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:21:57,183 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:21:57,184 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:21:57,185 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:21:57,185 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:21:57,186 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:21:57,187 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:21:57,187 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:21:57,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:21:57,189 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:21:57,189 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:21:57,206 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:21:57,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:21:57,208 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:21:57,210 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:21:57,210 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:21:57,210 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:21:57,211 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:21:57,211 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:21:57,211 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:21:57,211 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:21:57,212 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:21:57,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:21:57,212 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:21:57,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:21:57,212 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:21:57,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:21:57,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:21:57,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:21:57,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:21:57,214 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:21:57,214 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:21:57,214 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:21:57,214 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:21:57,214 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:21:57,215 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:21:57,215 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:21:57,215 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:21:57,215 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:21:57,216 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:21:57,217 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0baccb6c9a05802d446420fb16b8e65dc76eab5e [2019-01-14 02:21:57,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:21:57,265 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:21:57,268 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:21:57,270 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:21:57,270 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:21:57,271 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c [2019-01-14 02:21:57,344 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab6b548/72eae8e7496445ffb74366d95a56a8e0/FLAGdefb53475 [2019-01-14 02:21:57,748 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:21:57,748 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-restricted-15/java_Nested_true-termination_true-no-overflow.c [2019-01-14 02:21:57,755 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab6b548/72eae8e7496445ffb74366d95a56a8e0/FLAGdefb53475 [2019-01-14 02:21:58,142 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9ab6b548/72eae8e7496445ffb74366d95a56a8e0 [2019-01-14 02:21:58,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:21:58,147 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:21:58,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:58,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:21:58,152 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:21:58,153 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2359d8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58, skipping insertion in model container [2019-01-14 02:21:58,157 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:21:58,182 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:21:58,392 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:58,398 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:21:58,417 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:21:58,433 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:21:58,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58 WrapperNode [2019-01-14 02:21:58,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:21:58,436 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:58,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:21:58,436 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:21:58,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,454 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:21:58,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:21:58,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:21:58,477 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:21:58,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... [2019-01-14 02:21:58,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:21:58,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:21:58,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:21:58,503 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:21:58,505 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:21:58,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:21:58,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:21:58,915 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:21:58,916 INFO L286 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-14 02:21:58,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:58 BoogieIcfgContainer [2019-01-14 02:21:58,918 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:21:58,918 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:21:58,918 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:21:58,923 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:21:58,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:58,925 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:21:58" (1/3) ... [2019-01-14 02:21:58,926 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c275b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:58, skipping insertion in model container [2019-01-14 02:21:58,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:58,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:21:58" (2/3) ... [2019-01-14 02:21:58,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@30c275b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:21:58, skipping insertion in model container [2019-01-14 02:21:58,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:21:58,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:58" (3/3) ... [2019-01-14 02:21:58,930 INFO L375 chiAutomizerObserver]: Analyzing ICFG java_Nested_true-termination_true-no-overflow.c [2019-01-14 02:21:58,994 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:21:58,995 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:21:58,995 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:21:58,995 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:21:58,995 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:21:58,995 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:21:58,996 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:21:58,996 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:21:58,996 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:21:59,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:59,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:59,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:59,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:59,050 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:59,050 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:59,050 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:21:59,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-14 02:21:59,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-14 02:21:59,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:59,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:59,053 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:59,054 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-14 02:21:59,062 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 7#L10-2true [2019-01-14 02:21:59,063 INFO L796 eck$LassoCheckResult]: Loop: 7#L10-2true assume !!(main_~i~0 < 10);main_~j~0 := 3; 3#L12-2true assume !(main_~j~0 < 12); 10#L12-3true main_~i~0 := 1 + main_~i~0; 7#L10-2true [2019-01-14 02:21:59,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,070 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:21:59,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:59,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,164 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2019-01-14 02:21:59,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:59,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:59,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:21:59,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:21:59,266 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:21:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 02:21:59,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 02:21:59,296 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2019-01-14 02:21:59,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:59,369 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-14 02:21:59,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 02:21:59,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-14 02:21:59,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:21:59,384 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2019-01-14 02:21:59,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:21:59,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:21:59,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2019-01-14 02:21:59,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:59,390 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:21:59,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2019-01-14 02:21:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-14 02:21:59,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:21:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2019-01-14 02:21:59,429 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:21:59,430 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2019-01-14 02:21:59,430 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:21:59,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2019-01-14 02:21:59,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:21:59,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:59,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:59,431 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:59,432 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 02:21:59,432 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 29#L10-2 [2019-01-14 02:21:59,432 INFO L796 eck$LassoCheckResult]: Loop: 29#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 26#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 27#L12-2 assume !(main_~j~0 < 12); 30#L12-3 main_~i~0 := 1 + main_~i~0; 29#L10-2 [2019-01-14 02:21:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:21:59,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:59,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2019-01-14 02:21:59,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,467 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:59,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:59,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:21:59,547 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:21:59,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:59,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:59,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:59,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:21:59,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 02:21:59,624 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:21:59,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:21:59,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:21:59,625 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2019-01-14 02:21:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:59,670 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2019-01-14 02:21:59,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:21:59,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2019-01-14 02:21:59,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:21:59,673 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:21:59,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:21:59,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 02:21:59,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-14 02:21:59,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:59,675 INFO L706 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:21:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-14 02:21:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-14 02:21:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-14 02:21:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-14 02:21:59,678 INFO L729 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:21:59,678 INFO L609 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-14 02:21:59,678 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:21:59,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-14 02:21:59,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:21:59,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:59,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:59,680 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:59,680 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1] [2019-01-14 02:21:59,681 INFO L794 eck$LassoCheckResult]: Stem: 55#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 56#L10-2 [2019-01-14 02:21:59,681 INFO L796 eck$LassoCheckResult]: Loop: 56#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 53#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 54#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 58#L12-2 assume !(main_~j~0 < 12); 57#L12-3 main_~i~0 := 1 + main_~i~0; 56#L10-2 [2019-01-14 02:21:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,681 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 3 times [2019-01-14 02:21:59,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:21:59,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,691 INFO L82 PathProgramCache]: Analyzing trace with hash 38449199, now seen corresponding path program 2 times [2019-01-14 02:21:59,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,691 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:59,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:21:59,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:59,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:21:59,807 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:21:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:21:59,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:21:59,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:21:59,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:21:59,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:21:59,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:21:59,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-01-14 02:21:59,859 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:21:59,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:21:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:21:59,861 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-14 02:21:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:21:59,897 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-14 02:21:59,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:21:59,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-01-14 02:21:59,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:21:59,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 8 transitions. [2019-01-14 02:21:59,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:21:59,899 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:21:59,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2019-01-14 02:21:59,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:21:59,899 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:21:59,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2019-01-14 02:21:59,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:21:59,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:21:59,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-14 02:21:59,902 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:21:59,902 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-14 02:21:59,902 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:21:59,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2019-01-14 02:21:59,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:21:59,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:21:59,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:21:59,903 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:21:59,903 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 1, 1, 1] [2019-01-14 02:21:59,904 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 89#L10-2 [2019-01-14 02:21:59,904 INFO L796 eck$LassoCheckResult]: Loop: 89#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 86#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 87#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 92#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 91#L12-2 assume !(main_~j~0 < 12); 90#L12-3 main_~i~0 := 1 + main_~i~0; 89#L10-2 [2019-01-14 02:21:59,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,904 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 4 times [2019-01-14 02:21:59,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:59,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:21:59,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:21:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1191926928, now seen corresponding path program 3 times [2019-01-14 02:21:59,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:21:59,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:21:59,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,913 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:21:59,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:21:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:00,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:22:00,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 02:22:00,070 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-14 02:22:00,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:22:00,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:00,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:00,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-14 02:22:00,100 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:00,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:22:00,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:22:00,101 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand 6 states. [2019-01-14 02:22:00,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:00,129 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2019-01-14 02:22:00,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:22:00,130 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8 states and 9 transitions. [2019-01-14 02:22:00,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:22:00,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8 states to 8 states and 9 transitions. [2019-01-14 02:22:00,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:22:00,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:22:00,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-01-14 02:22:00,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:00,133 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:22:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-01-14 02:22:00,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-14 02:22:00,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:22:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-14 02:22:00,135 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:22:00,135 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-14 02:22:00,135 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:22:00,136 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2019-01-14 02:22:00,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:22:00,136 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:00,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:00,137 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:00,137 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 1, 1, 1] [2019-01-14 02:22:00,137 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 128#L10-2 [2019-01-14 02:22:00,137 INFO L796 eck$LassoCheckResult]: Loop: 128#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 125#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 126#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 132#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 131#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 130#L12-2 assume !(main_~j~0 < 12); 129#L12-3 main_~i~0 := 1 + main_~i~0; 128#L10-2 [2019-01-14 02:22:00,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:00,137 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 5 times [2019-01-14 02:22:00,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:00,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:00,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:00,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:00,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:00,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1704969137, now seen corresponding path program 4 times [2019-01-14 02:22:00,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:00,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:00,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:00,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:00,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:00,571 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:22:00,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 02:22:00,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 02:22:00,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:22:00,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:00,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 02:22:00,633 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:00,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:22:00,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:22:00,634 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 2 Second operand 7 states. [2019-01-14 02:22:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:00,683 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-14 02:22:00,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:22:00,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-14 02:22:00,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:22:00,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2019-01-14 02:22:00,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2019-01-14 02:22:00,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:22:00,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2019-01-14 02:22:00,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:00,687 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-14 02:22:00,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2019-01-14 02:22:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-14 02:22:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:22:00,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-14 02:22:00,691 INFO L729 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-14 02:22:00,691 INFO L609 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-14 02:22:00,691 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:22:00,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2019-01-14 02:22:00,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-01-14 02:22:00,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:00,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:00,692 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:00,692 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 1, 1, 1] [2019-01-14 02:22:00,693 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 173#L10-2 [2019-01-14 02:22:00,693 INFO L796 eck$LassoCheckResult]: Loop: 173#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 170#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 171#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 178#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 177#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 176#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 175#L12-2 assume !(main_~j~0 < 12); 174#L12-3 main_~i~0 := 1 + main_~i~0; 173#L10-2 [2019-01-14 02:22:00,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:00,693 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 6 times [2019-01-14 02:22:00,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:00,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:00,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:00,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:00,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:00,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1314433936, now seen corresponding path program 5 times [2019-01-14 02:22:00,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:00,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:00,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:00,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:00,837 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:00,837 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 [2019-01-14 02:22:00,854 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:22:00,901 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 02:22:00,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:22:00,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:00,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:00,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:22:00,953 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:00,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 02:22:00,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 02:22:00,954 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 8 states. [2019-01-14 02:22:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:01,072 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2019-01-14 02:22:01,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 02:22:01,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2019-01-14 02:22:01,076 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:22:01,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2019-01-14 02:22:01,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:22:01,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:22:01,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2019-01-14 02:22:01,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:01,077 INFO L706 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:22:01,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2019-01-14 02:22:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-14 02:22:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:22:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-01-14 02:22:01,079 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:22:01,079 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-01-14 02:22:01,079 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:22:01,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2019-01-14 02:22:01,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2019-01-14 02:22:01,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:01,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:01,081 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:01,081 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [6, 1, 1, 1] [2019-01-14 02:22:01,081 INFO L794 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 224#L10-2 [2019-01-14 02:22:01,081 INFO L796 eck$LassoCheckResult]: Loop: 224#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 221#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 222#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 230#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 229#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 228#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 227#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 226#L12-2 assume !(main_~j~0 < 12); 225#L12-3 main_~i~0 := 1 + main_~i~0; 224#L10-2 [2019-01-14 02:22:01,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 7 times [2019-01-14 02:22:01,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:01,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2092744593, now seen corresponding path program 6 times [2019-01-14 02:22:01,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:01,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:01,218 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:01,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:01,219 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:22:01,231 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 02:22:01,247 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-01-14 02:22:01,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:22:01,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:01,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:01,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2019-01-14 02:22:01,281 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:01,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 02:22:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 02:22:01,282 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 9 states. [2019-01-14 02:22:01,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:01,323 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-14 02:22:01,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 02:22:01,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2019-01-14 02:22:01,326 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:22:01,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 12 transitions. [2019-01-14 02:22:01,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:22:01,327 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-01-14 02:22:01,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 12 transitions. [2019-01-14 02:22:01,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:01,329 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-14 02:22:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 12 transitions. [2019-01-14 02:22:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:22:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:22:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-14 02:22:01,332 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-14 02:22:01,332 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-14 02:22:01,332 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:22:01,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2019-01-14 02:22:01,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:22:01,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:01,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:01,335 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:01,335 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 1, 1, 1] [2019-01-14 02:22:01,336 INFO L794 eck$LassoCheckResult]: Stem: 280#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 281#L10-2 [2019-01-14 02:22:01,336 INFO L796 eck$LassoCheckResult]: Loop: 281#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 278#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 279#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 288#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 287#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 286#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 285#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 284#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 283#L12-2 assume !(main_~j~0 < 12); 282#L12-3 main_~i~0 := 1 + main_~i~0; 281#L10-2 [2019-01-14 02:22:01,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,336 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 8 times [2019-01-14 02:22:01,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:01,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,342 INFO L82 PathProgramCache]: Analyzing trace with hash -450571184, now seen corresponding path program 7 times [2019-01-14 02:22:01,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,344 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:01,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:01,803 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:22:01,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:01,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:01,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:01,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2019-01-14 02:22:01,866 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:01,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 02:22:01,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 02:22:01,867 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 2 Second operand 10 states. [2019-01-14 02:22:01,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:01,924 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-01-14 02:22:01,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 02:22:01,926 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2019-01-14 02:22:01,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:22:01,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 02:22:01,928 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-01-14 02:22:01,928 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:22:01,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 13 transitions. [2019-01-14 02:22:01,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:01,929 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:22:01,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 13 transitions. [2019-01-14 02:22:01,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-14 02:22:01,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-14 02:22:01,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-14 02:22:01,933 INFO L729 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:22:01,933 INFO L609 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-14 02:22:01,933 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:22:01,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2019-01-14 02:22:01,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:22:01,934 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:01,934 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:01,934 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:01,934 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [8, 1, 1, 1] [2019-01-14 02:22:01,935 INFO L794 eck$LassoCheckResult]: Stem: 343#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 344#L10-2 [2019-01-14 02:22:01,937 INFO L796 eck$LassoCheckResult]: Loop: 344#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 341#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 342#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 352#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 351#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 350#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 349#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 348#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 347#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 346#L12-2 assume !(main_~j~0 < 12); 345#L12-3 main_~i~0 := 1 + main_~i~0; 344#L10-2 [2019-01-14 02:22:01,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,937 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 9 times [2019-01-14 02:22:01,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:01,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:01,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:01,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1082803057, now seen corresponding path program 8 times [2019-01-14 02:22:01,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:01,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:01,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:01,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:02,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:22:02,223 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:22:02,235 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 02:22:02,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 02:22:02,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:22:02,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:02,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:02,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:22:02,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-14 02:22:02,297 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:22:02,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 02:22:02,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 02:22:02,298 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 11 states. [2019-01-14 02:22:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:22:02,358 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2019-01-14 02:22:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 02:22:02,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2019-01-14 02:22:02,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:22:02,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2019-01-14 02:22:02,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 02:22:02,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-14 02:22:02,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2019-01-14 02:22:02,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:02,362 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-14 02:22:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2019-01-14 02:22:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-14 02:22:02,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:22:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-14 02:22:02,367 INFO L729 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-14 02:22:02,367 INFO L609 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-14 02:22:02,367 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:22:02,367 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2019-01-14 02:22:02,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:22:02,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:02,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:02,368 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:22:02,368 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 1, 1, 1] [2019-01-14 02:22:02,369 INFO L794 eck$LassoCheckResult]: Stem: 412#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 413#L10-2 [2019-01-14 02:22:02,371 INFO L796 eck$LassoCheckResult]: Loop: 413#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 410#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 411#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 422#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 421#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 420#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 419#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 418#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 417#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 416#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 415#L12-2 assume !(main_~j~0 < 12); 414#L12-3 main_~i~0 := 1 + main_~i~0; 413#L10-2 [2019-01-14 02:22:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:02,371 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 10 times [2019-01-14 02:22:02,371 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:02,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:02,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:02,377 INFO L82 PathProgramCache]: Analyzing trace with hash 792845360, now seen corresponding path program 9 times [2019-01-14 02:22:02,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:02,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:02,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:02,401 INFO L82 PathProgramCache]: Analyzing trace with hash 287286735, now seen corresponding path program 1 times [2019-01-14 02:22:02,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:02,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:02,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:02,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:02,763 WARN L181 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2019-01-14 02:22:02,918 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-14 02:22:02,947 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:02,949 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:02,951 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:02,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:02,951 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:02,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:02,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:02,952 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:02,953 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-14 02:22:02,953 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:02,954 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:02,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,239 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:03,240 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:03,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:03,247 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:03,276 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:03,276 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:22:03,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:03,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:03,304 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:03,304 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:22:03,311 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:03,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:03,331 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:03,332 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=12} Honda state: {ULTIMATE.start_main_~j~0=12} 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 [2019-01-14 02:22:03,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:03,368 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) [2019-01-14 02:22:03,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:03,446 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:03,509 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:03,512 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:03,512 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:03,512 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:03,512 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:03,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:03,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:03,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:03,513 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:03,513 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration10_Loop [2019-01-14 02:22:03,513 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:03,513 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:03,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,671 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:03,676 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:03,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:03,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:03,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:03,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:03,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:03,684 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:03,684 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:03,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:03,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:03,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:03,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:03,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:03,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:03,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:03,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:03,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:03,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:03,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:03,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:03,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:03,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:03,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:03,701 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:03,701 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:03,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:03,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:03,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:03,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:03,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:03,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:03,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:03,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:03,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:03,718 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:03,721 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:03,722 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:03,724 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:03,724 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:03,724 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:03,726 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 19 Supporting invariants [] [2019-01-14 02:22:03,728 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:03,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:03,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:03,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:03,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:03,856 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 02:22:03,861 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:22:03,862 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-01-14 02:22:03,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 25 states and 28 transitions. Complement of second has 4 states. [2019-01-14 02:22:03,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:22:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:22:03,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:22:03,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 12 letters. [2019-01-14 02:22:03,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:03,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 13 letters. Loop has 12 letters. [2019-01-14 02:22:03,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:03,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 24 letters. [2019-01-14 02:22:03,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:03,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2019-01-14 02:22:03,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:22:03,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 27 transitions. [2019-01-14 02:22:03,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-01-14 02:22:03,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-01-14 02:22:03,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 27 transitions. [2019-01-14 02:22:03,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:03,916 INFO L706 BuchiCegarLoop]: Abstraction has 24 states and 27 transitions. [2019-01-14 02:22:03,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 27 transitions. [2019-01-14 02:22:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2019-01-14 02:22:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:22:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2019-01-14 02:22:03,918 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:22:03,918 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 18 transitions. [2019-01-14 02:22:03,918 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:22:03,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 18 transitions. [2019-01-14 02:22:03,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:22:03,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:03,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:03,920 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-14 02:22:03,920 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:22:03,920 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 511#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 507#L12-2 [2019-01-14 02:22:03,920 INFO L796 eck$LassoCheckResult]: Loop: 507#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 507#L12-2 [2019-01-14 02:22:03,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:03,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2019-01-14 02:22:03,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:03,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:03,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 02:22:03,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:03,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:03,931 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 02:22:03,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:03,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:03,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:03,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:03,993 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:03,993 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:03,993 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:03,993 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:03,994 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:03,994 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:03,994 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:03,994 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:03,994 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-14 02:22:03,994 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:03,995 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:03,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:03,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,106 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:04,106 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 [2019-01-14 02:22:04,112 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,112 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:04,134 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:22:04,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:04,163 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:22:04,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,182 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 [2019-01-14 02:22:04,234 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:04,234 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,263 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:04,264 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=-1}, {ULTIMATE.start_main_~c~0=2}] Lambdas: [4, 3, 1] Nus: [0, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:04,288 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:04,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:04,347 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:04,349 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:04,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:04,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:04,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:04,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:04,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:04,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:04,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration11_Loop [2019-01-14 02:22:04,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:04,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:04,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,500 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:04,500 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:04,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:04,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:04,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:04,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:04,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:04,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:04,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:04,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:04,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:04,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:04,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:04,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:04,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:04,512 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:22:04,513 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:22:04,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:04,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:04,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:04,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:04,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:04,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:04,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:04,520 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:04,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:04,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:04,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:04,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:04,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:04,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:04,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:04,524 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:04,525 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:04,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:04,527 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:04,529 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:04,530 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:04,530 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:04,531 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:04,531 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:04,531 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] [2019-01-14 02:22:04,532 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:04,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:04,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:04,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:04,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:04,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:04,644 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:04,644 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5 Second operand 2 states. [2019-01-14 02:22:04,662 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 18 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 31 states and 36 transitions. Complement of second has 5 states. [2019-01-14 02:22:04,665 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 [2019-01-14 02:22:04,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:22:04,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:22:04,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2019-01-14 02:22:04,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:04,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 02:22:04,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:04,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-14 02:22:04,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:04,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2019-01-14 02:22:04,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:22:04,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 31 transitions. [2019-01-14 02:22:04,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:22:04,671 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:22:04,671 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 31 transitions. [2019-01-14 02:22:04,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:22:04,671 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-01-14 02:22:04,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 31 transitions. [2019-01-14 02:22:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-14 02:22:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:22:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2019-01-14 02:22:04,675 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:22:04,675 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2019-01-14 02:22:04,675 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:22:04,675 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2019-01-14 02:22:04,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 02:22:04,676 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:22:04,676 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:22:04,676 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [9, 2, 1, 1, 1] [2019-01-14 02:22:04,676 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 02:22:04,677 INFO L794 eck$LassoCheckResult]: Stem: 585#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~c~0;havoc main_~i~0;havoc main_~j~0;havoc main_~c~0;main_~c~0 := 0;main_~i~0 := 0; 586#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 583#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 584#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 596#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 595#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 594#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 593#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 592#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 591#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 590#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 589#L12-2 assume !(main_~j~0 < 12); 588#L12-3 main_~i~0 := 1 + main_~i~0; 587#L10-2 assume !!(main_~i~0 < 10);main_~j~0 := 3; 582#L12-2 [2019-01-14 02:22:04,677 INFO L796 eck$LassoCheckResult]: Loop: 582#L12-2 assume !!(main_~j~0 < 12);main_~j~0 := main_~j~0 - 1;main_~c~0 := 1 + main_~c~0;main_~j~0 := 2 + main_~j~0; 582#L12-2 [2019-01-14 02:22:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash 315954203, now seen corresponding path program 2 times [2019-01-14 02:22:04,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:22:04,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2019-01-14 02:22:04,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:04,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1204645720, now seen corresponding path program 3 times [2019-01-14 02:22:04,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:22:04,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:22:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:22:04,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:22:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:22:04,766 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:04,766 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:04,766 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:04,766 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:04,766 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:22:04,767 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:04,767 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:04,767 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:04,767 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-14 02:22:04,767 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:04,767 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:04,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:04,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:05,231 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) [2019-01-14 02:22:05,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:05,245 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 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 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 [2019-01-14 02:22:05,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:05,281 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:05,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:05,306 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=0} Honda state: {ULTIMATE.start_main_~c~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=-1}, {ULTIMATE.start_main_~c~0=2}] Lambdas: [4, 3, 1] Nus: [0, 1] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:05,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:05,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:05,353 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:22:05,353 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-14 02:22:05,358 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:22:05,358 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 [2019-01-14 02:22:05,391 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:22:05,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:22:05,435 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:22:05,438 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:22:05,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:22:05,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:22:05,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:22:05,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:22:05,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:22:05,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:22:05,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:22:05,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: java_Nested_true-termination_true-no-overflow.c_Iteration12_Loop [2019-01-14 02:22:05,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:22:05,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:22:05,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:22:05,557 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:22:05,558 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:22:05,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:05,559 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:05,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:05,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:05,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:05,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:05,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:05,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:05,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:22:05,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:22:05,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:22:05,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:22:05,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:22:05,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:22:05,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:22:05,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:22:05,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:22:05,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:22:05,577 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:22:05,578 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:22:05,579 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:22:05,579 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:22:05,579 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:22:05,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 23 Supporting invariants [] [2019-01-14 02:22:05,579 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:22:05,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:05,645 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:05,645 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:22:05,707 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-01-14 02:22:05,708 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 [2019-01-14 02:22:05,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:22:05,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:22:05,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-14 02:22:05,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,709 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:22:05,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:05,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:05,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:22:05,777 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 29 states and 33 transitions. Complement of second has 5 states. [2019-01-14 02:22:05,779 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 [2019-01-14 02:22:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:22:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:22:05,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-14 02:22:05,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,780 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:22:05,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:22:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:22:05,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:22:05,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:22:05,812 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 02:22:05,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand 2 states. [2019-01-14 02:22:05,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 17 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 18 states and 20 transitions. Complement of second has 4 states. [2019-01-14 02:22:05,823 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 [2019-01-14 02:22:05,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 02:22:05,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2019-01-14 02:22:05,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 1 letters. [2019-01-14 02:22:05,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 15 letters. Loop has 1 letters. [2019-01-14 02:22:05,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 14 letters. Loop has 2 letters. [2019-01-14 02:22:05,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:22:05,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 20 transitions. [2019-01-14 02:22:05,829 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:22:05,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-14 02:22:05,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:22:05,829 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:22:05,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:22:05,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:22:05,830 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:22:05,830 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:22:05,830 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:22:05,830 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:22:05,830 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:22:05,830 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:22:05,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:22:05,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:22:05 BoogieIcfgContainer [2019-01-14 02:22:05,837 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:22:05,837 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:22:05,837 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:22:05,838 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:22:05,838 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:21:58" (3/4) ... [2019-01-14 02:22:05,842 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:22:05,842 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:22:05,843 INFO L168 Benchmark]: Toolchain (without parser) took 7696.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -166.1 MB). Peak memory consumption was 43.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:05,844 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:05,844 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:05,845 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:05,846 INFO L168 Benchmark]: Boogie Preprocessor took 25.81 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:05,846 INFO L168 Benchmark]: RCFGBuilder took 415.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:05,847 INFO L168 Benchmark]: BuchiAutomizer took 6918.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. [2019-01-14 02:22:05,848 INFO L168 Benchmark]: Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:22:05,852 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 287.24 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 936.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 40.31 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.81 ms. Allocated memory is still 1.0 GB. Free memory is still 936.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 415.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -183.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6918.63 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 80.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (9 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 19 and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * j + 23 and consists of 3 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 13 iterations. TraceHistogramMax:9. Analysis of lassos took 5.5s. Construction of modules took 0.4s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 10. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 21 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 10. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 45/45 HoareTripleCheckerStatistics: 62 SDtfs, 21 SDslu, 50 SDs, 0 SdLazy, 157 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI9 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax171 hnf99 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...