./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.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-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.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 f36e762e796a59800b85d8514c20c7f73c19b5c1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:14:33,087 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:14:33,089 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:14:33,101 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:14:33,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:14:33,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:14:33,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:14:33,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:14:33,107 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:14:33,108 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:14:33,110 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:14:33,110 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:14:33,111 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:14:33,112 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:14:33,114 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:14:33,114 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:14:33,115 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:14:33,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:14:33,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:14:33,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:14:33,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:14:33,124 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:14:33,127 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:14:33,127 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:14:33,127 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:14:33,128 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:14:33,129 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:14:33,131 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:14:33,132 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:14:33,133 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:14:33,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:14:33,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:14:33,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:14:33,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:14:33,137 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:14:33,138 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:14:33,138 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:14:33,174 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:14:33,175 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:14:33,176 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:14:33,177 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:14:33,177 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:14:33,178 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:14:33,178 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:14:33,178 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:14:33,178 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:14:33,178 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:14:33,179 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:14:33,179 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:14:33,179 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:14:33,179 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:14:33,179 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:14:33,180 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:14:33,182 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:14:33,182 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:14:33,182 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:14:33,182 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:14:33,182 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:14:33,183 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:14:33,184 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:14:33,184 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:14:33,185 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:14:33,185 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:14:33,185 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:14:33,185 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:14:33,187 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:14:33,188 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 -> f36e762e796a59800b85d8514c20c7f73c19b5c1 [2019-01-14 02:14:33,225 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:14:33,238 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:14:33,242 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:14:33,243 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:14:33,244 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:14:33,244 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:33,298 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c817b367/2bc833f33e234c4e95827583d427dda0/FLAG6938b7d43 [2019-01-14 02:14:33,657 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:14:33,657 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:33,663 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c817b367/2bc833f33e234c4e95827583d427dda0/FLAG6938b7d43 [2019-01-14 02:14:34,042 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c817b367/2bc833f33e234c4e95827583d427dda0 [2019-01-14 02:14:34,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:14:34,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:14:34,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:34,050 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:14:34,054 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:14:34,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f3a513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34, skipping insertion in model container [2019-01-14 02:14:34,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:14:34,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:14:34,312 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:34,319 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:14:34,340 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:14:34,357 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:14:34,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34 WrapperNode [2019-01-14 02:14:34,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:14:34,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:34,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:14:34,359 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:14:34,369 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:14:34" (1/1) ... [2019-01-14 02:14:34,375 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:14:34" (1/1) ... [2019-01-14 02:14:34,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:14:34,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:14:34,398 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:14:34,399 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:14:34,411 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,411 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,412 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (1/1) ... [2019-01-14 02:14:34,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:14:34,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:14:34,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:14:34,424 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:14:34,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (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:14:34,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:14:34,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:14:34,815 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:14:34,815 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-14 02:14:34,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:34 BoogieIcfgContainer [2019-01-14 02:14:34,817 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:14:34,818 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:14:34,818 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:14:34,823 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:14:34,824 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:34,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:14:34" (1/3) ... [2019-01-14 02:14:34,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc36826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:34, skipping insertion in model container [2019-01-14 02:14:34,827 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:34,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:14:34" (2/3) ... [2019-01-14 02:14:34,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cc36826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:14:34, skipping insertion in model container [2019-01-14 02:14:34,828 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:14:34,829 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:34" (3/3) ... [2019-01-14 02:14:34,831 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 02:14:34,898 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:14:34,899 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:14:34,899 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:14:34,899 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:14:34,899 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:14:34,899 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:14:34,900 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:14:34,900 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:14:34,901 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:14:34,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:14:34,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:34,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:34,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:34,960 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:14:34,961 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:34,961 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:14:34,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2019-01-14 02:14:34,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:34,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:34,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:34,964 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:14:34,964 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:34,978 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 8#L15-2true [2019-01-14 02:14:34,978 INFO L796 eck$LassoCheckResult]: Loop: 8#L15-2true assume !!(main_~c~0 > 0); 3#L15true assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 8#L15-2true [2019-01-14 02:14:34,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:34,985 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 02:14:34,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:34,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:35,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:35,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2019-01-14 02:14:35,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:35,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:35,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:35,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:35,139 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2019-01-14 02:14:35,139 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:35,139 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:35,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:35,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:35,297 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-14 02:14:35,358 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:35,359 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:35,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:35,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:35,360 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:35,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,360 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:35,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:35,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-14 02:14:35,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:35,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:35,385 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:14:35,406 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:14:35,424 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:14:35,455 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:14:35,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:35,679 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:35,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:35,723 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:35,723 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:35,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:35,751 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:35,752 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:35,758 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,783 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:35,783 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:35,806 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:35,808 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:35,808 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:35,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:35,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:35,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:35,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:35,809 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:35,809 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:35,809 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2019-01-14 02:14:35,809 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:35,809 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:35,812 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:14:35,841 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:14:35,850 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:14:35,867 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:14:36,197 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:36,204 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:36,206 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:14:36,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:36,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:36,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:36,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:36,214 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:36,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:36,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:36,224 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:14:36,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:36,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:36,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:36,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:36,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:36,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:36,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:36,257 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:14:36,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:36,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:36,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:36,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:36,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:36,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:36,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:36,273 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:36,280 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:36,281 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:36,283 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:36,283 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:36,283 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:36,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:36,285 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:36,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:36,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:36,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:36,390 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:14:36,412 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:14:36,414 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2019-01-14 02:14:36,498 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 6 states. [2019-01-14 02:14:36,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:36,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:36,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2019-01-14 02:14:36,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:14:36,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:36,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:14:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:36,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:14:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:36,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-14 02:14:36,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:36,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2019-01-14 02:14:36,517 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:14:36,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 02:14:36,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2019-01-14 02:14:36,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:36,518 INFO L706 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:14:36,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2019-01-14 02:14:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-14 02:14:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:14:36,548 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:14:36,549 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:14:36,549 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:14:36,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2019-01-14 02:14:36,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:36,550 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:36,550 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:36,550 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:14:36,551 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:36,551 INFO L794 eck$LassoCheckResult]: Stem: 67#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 68#L15-2 assume !!(main_~c~0 > 0); 63#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 64#L15-2 [2019-01-14 02:14:36,551 INFO L796 eck$LassoCheckResult]: Loop: 64#L15-2 assume !!(main_~c~0 > 0); 69#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 64#L15-2 [2019-01-14 02:14:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2019-01-14 02:14:36,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:36,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2019-01-14 02:14:36,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2019-01-14 02:14:36,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:36,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:36,615 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:36,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:36,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:36,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:36,616 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:36,616 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,616 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:36,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:36,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:14:36,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:36,617 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:36,619 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:14:36,633 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:14:36,643 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:14:36,653 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:14:36,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:36,749 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:36,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:36,774 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:36,774 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:36,779 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:36,807 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:36,831 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:36,833 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:36,833 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:36,833 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:36,833 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:36,833 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:36,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:36,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:36,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:36,834 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2019-01-14 02:14:36,834 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:36,834 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:36,836 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:14:36,841 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:14:36,855 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:14:36,869 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:14:37,125 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:14:37,244 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:37,244 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:37,244 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:14:37,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:37,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:37,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:37,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:37,248 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:37,248 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:37,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:37,253 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:14:37,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:37,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:37,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:37,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:37,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:37,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:37,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:37,262 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:37,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:37,269 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:37,269 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:37,269 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:37,270 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:37,270 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-14 02:14:37,270 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:37,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:37,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:37,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:37,381 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:14:37,381 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:14:37,382 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-14 02:14:37,399 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:14:37,401 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:14:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:37,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:14:37,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:14:37,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:37,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:14:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:37,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:14:37,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:37,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2019-01-14 02:14:37,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:37,410 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:14:37,410 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:37,410 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:14:37,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2019-01-14 02:14:37,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:37,411 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:14:37,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2019-01-14 02:14:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 02:14:37,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2019-01-14 02:14:37,417 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:14:37,418 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2019-01-14 02:14:37,418 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:14:37,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2019-01-14 02:14:37,419 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:14:37,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:37,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:37,421 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:37,422 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:37,422 INFO L794 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 122#L15-2 assume !!(main_~c~0 > 0); 117#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 118#L15-2 assume !!(main_~c~0 > 0); 125#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 123#L15-2 [2019-01-14 02:14:37,422 INFO L796 eck$LassoCheckResult]: Loop: 123#L15-2 assume !!(main_~c~0 > 0); 124#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 123#L15-2 [2019-01-14 02:14:37,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:37,422 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2019-01-14 02:14:37,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:37,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:37,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:37,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:37,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2019-01-14 02:14:37,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:37,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:37,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2019-01-14 02:14:37,446 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:37,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:37,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:37,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:37,533 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:37,533 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:37,533 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:37,533 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:37,534 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:37,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:37,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:37,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:37,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:14:37,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:37,534 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:37,536 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:14:37,572 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:14:37,598 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:14:37,626 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:14:37,904 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-14 02:14:38,068 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:38,068 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:38,098 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:38,099 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 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:14:38,104 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,104 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,153 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:38,153 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:38,179 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:38,181 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:38,181 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:38,181 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:38,181 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:38,182 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:38,182 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,182 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:38,182 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:38,182 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2019-01-14 02:14:38,182 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:38,182 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:38,184 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:14:38,195 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:14:38,199 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:14:38,234 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:14:38,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:38,347 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:38,349 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:14:38,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:38,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:38,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:38,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:38,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:38,353 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:38,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:38,358 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:38,361 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:38,361 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:38,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:38,362 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:38,363 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:38,363 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-14 02:14:38,363 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,445 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:14:38,445 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:14:38,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:14:38,461 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-14 02:14:38,462 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:14:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:14:38,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:14:38,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,463 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:38,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,575 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:14:38,576 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:38,576 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:14:38,594 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2019-01-14 02:14:38,596 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:14:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:38,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-14 02:14:38,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:14:38,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,597 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:38,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:38,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:38,682 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:14:38,683 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:38,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2019-01-14 02:14:38,700 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2019-01-14 02:14:38,701 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:14:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:38,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:38,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:14:38,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:14:38,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:14:38,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:38,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2019-01-14 02:14:38,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:38,709 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2019-01-14 02:14:38,709 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:14:38,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:14:38,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2019-01-14 02:14:38,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:38,710 INFO L706 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2019-01-14 02:14:38,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2019-01-14 02:14:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2019-01-14 02:14:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:14:38,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-14 02:14:38,711 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:14:38,711 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 02:14:38,711 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:14:38,712 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-14 02:14:38,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:38,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:38,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:38,712 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 02:14:38,713 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:38,713 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 265#L15-2 [2019-01-14 02:14:38,713 INFO L796 eck$LassoCheckResult]: Loop: 265#L15-2 assume !!(main_~c~0 > 0); 264#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 265#L15-2 [2019-01-14 02:14:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 02:14:38,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:38,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2019-01-14 02:14:38,719 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:38,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2019-01-14 02:14:38,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:38,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:38,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:38,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:38,831 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:38,831 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:38,831 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:38,831 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:38,831 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:38,832 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,832 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:38,832 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:38,832 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:14:38,832 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:38,832 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:38,835 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:14:38,842 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:14:38,851 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:14:38,861 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:14:38,939 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:38,940 INFO L412 LassoAnalysis]: Checking for nontermination... 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:14:38,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:38,966 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:38,967 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} 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:14:38,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:38,971 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:38,994 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:38,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:39,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:39,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c~0=1} Honda state: {ULTIMATE.start_main_~c~0=1} Generalized eigenvectors: [{ULTIMATE.start_main_~c~0=1}, {ULTIMATE.start_main_~c~0=0}, {ULTIMATE.start_main_~c~0=0}] Lambdas: [1, 0, 0] Nus: [0, 0] 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:14:39,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:39,024 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:39,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:39,070 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:39,071 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:39,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:39,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:39,072 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:39,072 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:39,072 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:39,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:39,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2019-01-14 02:14:39,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:39,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:39,074 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:14:39,083 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:14:39,093 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:14:39,097 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:14:39,154 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:39,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:39,155 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:14:39,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:39,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:39,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:39,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:39,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:39,156 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:39,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:39,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:39,160 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:14:39,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:39,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:39,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:39,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:39,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:39,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:39,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:39,165 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:39,169 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:39,169 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:14:39,169 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:39,169 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:39,169 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:39,170 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-01-14 02:14:39,170 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:39,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:39,243 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:14:39,243 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:14:39,243 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 02:14:39,258 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:14:39,259 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:14:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2019-01-14 02:14:39,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2019-01-14 02:14:39,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:39,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:14:39,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:39,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 02:14:39,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:39,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2019-01-14 02:14:39,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:39,262 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2019-01-14 02:14:39,262 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:14:39,262 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:14:39,262 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2019-01-14 02:14:39,262 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:39,262 INFO L706 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2019-01-14 02:14:39,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2019-01-14 02:14:39,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-01-14 02:14:39,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:39,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2019-01-14 02:14:39,264 INFO L729 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:14:39,264 INFO L609 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2019-01-14 02:14:39,264 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 02:14:39,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2019-01-14 02:14:39,264 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 02:14:39,265 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:39,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:39,270 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2019-01-14 02:14:39,271 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:14:39,271 INFO L794 eck$LassoCheckResult]: Stem: 313#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 314#L15-2 assume !!(main_~c~0 > 0); 315#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 316#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-01-14 02:14:39,272 INFO L796 eck$LassoCheckResult]: Loop: 309#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 310#L15-2 assume !!(main_~c~0 > 0); 309#L15 [2019-01-14 02:14:39,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2019-01-14 02:14:39,273 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:39,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:39,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:39,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:39,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 02:14:39,322 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2019-01-14 02:14:39,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:39,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:39,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:39,352 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:39,352 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:39,352 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:39,352 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:39,353 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:39,353 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,353 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:39,353 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:39,353 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-14 02:14:39,353 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:39,354 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:39,355 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:14:39,368 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:14:39,379 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:14:39,382 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:14:39,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:39,446 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:39,450 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:14:39,476 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:39,476 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:39,513 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:39,513 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=0}, {ULTIMATE.start_main_~c~0=1}] Lambdas: [3, 12, 1] Nus: [0, 0] 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:14:39,533 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:39,533 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:14:39,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:39,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:39,595 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:39,597 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:39,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:39,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:39,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:39,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:39,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:39,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:39,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:39,598 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2019-01-14 02:14:39,598 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:39,598 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:39,600 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:14:39,607 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:14:39,611 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:14:39,618 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:14:39,697 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:39,697 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:39,698 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:14:39,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:39,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:39,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:39,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:39,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:39,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:39,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:39,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:39,704 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:14:39,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:39,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:39,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:39,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:39,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:39,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:39,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:39,709 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:14:39,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:39,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:39,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:39,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:39,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:39,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:39,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:39,719 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:39,725 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:39,725 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:14:39,725 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:39,725 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:39,732 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:39,732 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2019-01-14 02:14:39,732 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:39,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:39,869 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:14:39,870 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:14:39,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:14:39,882 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2019-01-14 02:14:39,884 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:14:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:14:39,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:14:39,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:39,885 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:39,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:39,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,922 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:39,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,008 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:14:40,009 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:40,009 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:14:40,067 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 10 states and 14 transitions. Complement of second has 5 states. [2019-01-14 02:14:40,070 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:14:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:40,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:40,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:14:40,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:40,071 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:40,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,158 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:14:40,159 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:14:40,159 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-01-14 02:14:40,197 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 16 states and 20 transitions. Complement of second has 4 states. [2019-01-14 02:14:40,199 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:14:40,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:14:40,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:14:40,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-14 02:14:40,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:40,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-14 02:14:40,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:40,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-14 02:14:40,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:40,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-01-14 02:14:40,208 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-01-14 02:14:40,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2019-01-14 02:14:40,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:14:40,209 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:14:40,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-14 02:14:40,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:40,212 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-14 02:14:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-14 02:14:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-14 02:14:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2019-01-14 02:14:40,214 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2019-01-14 02:14:40,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:14:40,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:14:40,223 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2019-01-14 02:14:40,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:40,264 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-14 02:14:40,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:14:40,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2019-01-14 02:14:40,268 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:40,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2019-01-14 02:14:40,268 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:14:40,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:14:40,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2019-01-14 02:14:40,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:40,272 INFO L706 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2019-01-14 02:14:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2019-01-14 02:14:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-01-14 02:14:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:40,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-14 02:14:40,273 INFO L729 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:14:40,273 INFO L609 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-14 02:14:40,273 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 02:14:40,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-14 02:14:40,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-14 02:14:40,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:40,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:40,277 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2019-01-14 02:14:40,277 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-14 02:14:40,277 INFO L794 eck$LassoCheckResult]: Stem: 462#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 463#L15-2 assume !!(main_~c~0 > 0); 461#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-01-14 02:14:40,277 INFO L796 eck$LassoCheckResult]: Loop: 459#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 460#L15-2 assume !!(main_~c~0 > 0); 464#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 465#L15-2 assume !!(main_~c~0 > 0); 459#L15 [2019-01-14 02:14:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2019-01-14 02:14:40,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:40,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:40,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:40,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2019-01-14 02:14:40,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:40,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:40,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2019-01-14 02:14:40,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:40,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:40,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:40,385 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:40,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:40,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:40,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:40,385 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:40,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:40,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:40,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:40,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-14 02:14:40,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:40,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:40,388 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:14:40,410 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:14:40,412 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:14:40,417 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:14:40,494 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:40,494 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:40,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:40,502 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:14:40,527 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:40,527 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:40,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:40,574 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:40,575 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:40,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:40,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:40,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:40,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:40,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:40,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:40,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2019-01-14 02:14:40,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:40,576 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:40,577 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:14:40,591 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:14:40,593 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:14:40,599 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:14:40,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:40,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:40,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:14:40,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:40,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:40,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:40,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:40,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:40,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:40,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:40,683 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:40,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:40,686 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 02:14:40,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:40,687 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:40,687 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:40,687 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2019-01-14 02:14:40,687 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:40,828 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:40,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:14:40,845 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-01-14 02:14:40,847 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:14:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:40,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2019-01-14 02:14:40,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:14:40,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:40,848 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:40,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:40,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:40,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:40,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:40,944 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:14:41,003 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 11 states and 14 transitions. Complement of second has 5 states. [2019-01-14 02:14:41,006 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:14:41,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:41,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:14:41,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,008 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:41,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:41,065 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:41,065 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:14:41,073 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 16 states and 19 transitions. Complement of second has 4 states. [2019-01-14 02:14:41,075 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:14:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:41,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-14 02:14:41,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:14:41,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,076 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:41,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:41,139 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:41,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:14:41,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 18 transitions. Complement of second has 4 states. [2019-01-14 02:14:41,168 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:14:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:41,169 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:14:41,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:41,252 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-14 02:14:41,254 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-14 02:14:41,369 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. Result 72 states and 96 transitions. Complement of second has 37 states 8 powerset states29 rank states. The highest rank that occured is 5 [2019-01-14 02:14:41,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:41,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:14:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-01-14 02:14:41,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-14 02:14:41,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 02:14:41,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2019-01-14 02:14:41,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:41,378 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2019-01-14 02:14:41,381 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-01-14 02:14:41,382 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2019-01-14 02:14:41,382 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:14:41,382 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-14 02:14:41,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2019-01-14 02:14:41,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:41,382 INFO L706 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-01-14 02:14:41,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2019-01-14 02:14:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2019-01-14 02:14:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-14 02:14:41,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2019-01-14 02:14:41,390 INFO L729 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-14 02:14:41,390 INFO L609 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2019-01-14 02:14:41,390 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 02:14:41,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2019-01-14 02:14:41,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:14:41,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:41,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:41,392 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2019-01-14 02:14:41,394 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-14 02:14:41,395 INFO L794 eck$LassoCheckResult]: Stem: 826#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 828#L15-2 assume !!(main_~c~0 > 0); 825#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-01-14 02:14:41,395 INFO L796 eck$LassoCheckResult]: Loop: 823#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 824#L15-2 assume !!(main_~c~0 > 0); 833#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 832#L15-2 assume !!(main_~c~0 > 0); 831#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 830#L15-2 assume !!(main_~c~0 > 0); 823#L15 [2019-01-14 02:14:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2019-01-14 02:14:41,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:41,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:41,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:41,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:41,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:41,503 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:41,514 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 02:14:41,542 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-01-14 02:14:41,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 02:14:41,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:41,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:41,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2019-01-14 02:14:41,574 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 02:14:41,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:41,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2019-01-14 02:14:41,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:41,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:41,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:41,675 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:41,675 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:41,675 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:41,675 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:41,676 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:41,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:41,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:41,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:41,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-14 02:14:41,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:41,677 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:41,678 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:14:41,683 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:14:41,702 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:14:41,707 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:14:41,906 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:41,906 INFO L412 LassoAnalysis]: Checking for nontermination... 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:14:41,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:41,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:41,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:41,931 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:41,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:41,936 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:41,960 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:41,960 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:42,036 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:42,039 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:42,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:42,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:42,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:42,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:42,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:42,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:42,039 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2019-01-14 02:14:42,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:42,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:42,041 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:14:42,048 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:14:42,055 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:14:42,059 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:14:42,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:42,157 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:42,157 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:14:42,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:42,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:42,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:42,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:42,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:42,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:42,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:42,166 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:14:42,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:42,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:42,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:42,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:42,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:42,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:42,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:42,172 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:42,175 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:42,175 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:42,176 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:42,176 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:42,176 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:42,176 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:42,177 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:42,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:42,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:42,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:42,279 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:14:42,279 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2019-01-14 02:14:42,314 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9. Second operand 5 states. Result 65 states and 87 transitions. Complement of second has 9 states. [2019-01-14 02:14:42,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:14:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2019-01-14 02:14:42,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2019-01-14 02:14:42,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:42,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2019-01-14 02:14:42,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:42,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2019-01-14 02:14:42,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:42,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2019-01-14 02:14:42,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:14:42,321 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2019-01-14 02:14:42,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2019-01-14 02:14:42,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2019-01-14 02:14:42,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2019-01-14 02:14:42,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:42,322 INFO L706 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2019-01-14 02:14:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2019-01-14 02:14:42,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2019-01-14 02:14:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 02:14:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2019-01-14 02:14:42,328 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2019-01-14 02:14:42,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 02:14:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 02:14:42,328 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2019-01-14 02:14:42,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:42,351 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2019-01-14 02:14:42,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 02:14:42,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2019-01-14 02:14:42,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:14:42,357 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2019-01-14 02:14:42,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:14:42,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2019-01-14 02:14:42,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2019-01-14 02:14:42,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:42,357 INFO L706 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-01-14 02:14:42,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2019-01-14 02:14:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-01-14 02:14:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-14 02:14:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-01-14 02:14:42,360 INFO L729 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:14:42,360 INFO L609 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-01-14 02:14:42,360 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-14 02:14:42,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2019-01-14 02:14:42,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-01-14 02:14:42,361 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:42,361 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:42,362 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2019-01-14 02:14:42,362 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2019-01-14 02:14:42,362 INFO L794 eck$LassoCheckResult]: Stem: 1095#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1096#L15-2 assume !!(main_~c~0 > 0); 1111#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1108#L15-2 assume !!(main_~c~0 > 0); 1101#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-01-14 02:14:42,362 INFO L796 eck$LassoCheckResult]: Loop: 1091#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1092#L15-2 assume !!(main_~c~0 > 0); 1102#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1100#L15-2 assume !!(main_~c~0 > 0); 1099#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1098#L15-2 assume !!(main_~c~0 > 0); 1091#L15 [2019-01-14 02:14:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2019-01-14 02:14:42,362 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:42,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:42,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2019-01-14 02:14:42,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:42,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:42,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:42,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:42,382 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2019-01-14 02:14:42,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:42,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:42,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:42,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:42,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 02:14:42,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 02:14:42,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:42,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:42,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 02:14:42,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-14 02:14:42,572 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:42,573 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:42,573 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:42,573 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:42,573 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:42,573 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,573 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:42,574 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:42,574 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-14 02:14:42,574 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:42,574 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:42,575 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:14:42,612 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:14:42,618 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:14:42,621 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:14:42,680 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:42,680 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:42,685 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:42,704 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:42,704 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,708 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:42,709 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:42,732 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:42,814 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:42,815 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:42,815 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:42,815 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:42,816 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:42,816 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:42,816 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:42,816 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:42,816 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:42,816 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2019-01-14 02:14:42,816 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:42,816 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:42,817 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:14:42,821 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:14:42,829 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:14:42,838 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:14:42,927 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:42,927 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:42,928 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:14:42,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:42,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:42,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:42,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:42,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:42,933 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:42,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:42,936 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:14:42,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:42,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:42,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:42,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:42,939 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:42,940 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:42,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:42,944 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:42,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:42,947 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:42,948 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:42,948 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:42,948 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:42,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:42,949 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:43,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:43,434 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:14:43,434 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:14:43,479 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-14 02:14:43,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:43,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:14:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-14 02:14:43,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:14:43,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:43,481 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:43,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:43,538 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:14:43,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:14:43,559 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 45 states and 56 transitions. Complement of second has 7 states. [2019-01-14 02:14:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:14:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2019-01-14 02:14:43,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:14:43,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:43,562 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:43,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:43,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:43,654 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-14 02:14:43,654 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-01-14 02:14:43,705 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 75 states and 99 transitions. Complement of second has 13 states. [2019-01-14 02:14:43,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 02:14:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-01-14 02:14:43,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2019-01-14 02:14:43,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2019-01-14 02:14:43,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:43,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2019-01-14 02:14:43,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:43,708 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2019-01-14 02:14:43,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2019-01-14 02:14:43,712 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2019-01-14 02:14:43,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2019-01-14 02:14:43,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2019-01-14 02:14:43,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2019-01-14 02:14:43,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:43,713 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2019-01-14 02:14:43,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2019-01-14 02:14:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-14 02:14:43,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 02:14:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-01-14 02:14:43,718 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-01-14 02:14:43,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 02:14:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 02:14:43,720 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2019-01-14 02:14:43,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:43,755 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-01-14 02:14:43,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 02:14:43,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2019-01-14 02:14:43,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2019-01-14 02:14:43,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2019-01-14 02:14:43,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2019-01-14 02:14:43,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:14:43,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2019-01-14 02:14:43,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:43,759 INFO L706 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2019-01-14 02:14:43,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2019-01-14 02:14:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2019-01-14 02:14:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:14:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2019-01-14 02:14:43,763 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:14:43,763 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2019-01-14 02:14:43,763 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2019-01-14 02:14:43,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2019-01-14 02:14:43,764 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-01-14 02:14:43,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:43,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:43,764 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:43,764 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2019-01-14 02:14:43,765 INFO L794 eck$LassoCheckResult]: Stem: 1638#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1640#L15-2 assume !!(main_~c~0 > 0); 1654#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1649#L15-2 assume !!(main_~c~0 > 0); 1645#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1646#L15-2 [2019-01-14 02:14:43,765 INFO L796 eck$LassoCheckResult]: Loop: 1646#L15-2 assume !!(main_~c~0 > 0); 1643#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1644#L15-2 assume !!(main_~c~0 > 0); 1648#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1641#L15-2 assume !!(main_~c~0 > 0); 1634#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1635#L15-2 assume !!(main_~c~0 > 0); 1645#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1646#L15-2 [2019-01-14 02:14:43,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2019-01-14 02:14:43,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:43,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2019-01-14 02:14:43,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,774 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:43,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:43,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 02:14:43,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:14:43,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 02:14:43,829 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 02:14:43,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 02:14:43,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 02:14:43,829 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-01-14 02:14:43,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:14:43,858 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2019-01-14 02:14:43,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 02:14:43,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2019-01-14 02:14:43,859 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:43,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2019-01-14 02:14:43,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-01-14 02:14:43,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:14:43,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2019-01-14 02:14:43,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:43,861 INFO L706 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-01-14 02:14:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2019-01-14 02:14:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-14 02:14:43,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 02:14:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-01-14 02:14:43,864 INFO L729 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 02:14:43,864 INFO L609 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-01-14 02:14:43,864 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2019-01-14 02:14:43,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2019-01-14 02:14:43,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2019-01-14 02:14:43,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:43,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:43,866 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:43,866 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2019-01-14 02:14:43,866 INFO L794 eck$LassoCheckResult]: Stem: 1729#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 1731#L15-2 assume !!(main_~c~0 > 0); 1745#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1740#L15-2 assume !!(main_~c~0 > 0); 1736#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1732#L15-2 [2019-01-14 02:14:43,866 INFO L796 eck$LassoCheckResult]: Loop: 1732#L15-2 assume !!(main_~c~0 > 0); 1733#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1735#L15-2 assume !!(main_~c~0 > 0); 1741#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1739#L15-2 assume !!(main_~c~0 > 0); 1725#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1726#L15-2 assume !!(main_~c~0 > 0); 1744#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 1742#L15-2 assume !!(main_~c~0 > 0); 1738#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 1732#L15-2 [2019-01-14 02:14:43,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2019-01-14 02:14:43,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:43,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2019-01-14 02:14:43,875 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2019-01-14 02:14:43,886 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:43,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:43,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:44,027 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-01-14 02:14:44,038 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:44,038 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:44,038 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:44,038 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:44,039 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:44,039 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:44,039 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:44,039 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:44,039 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2019-01-14 02:14:44,039 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:44,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:44,041 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:14:44,046 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:14:44,051 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:14:44,057 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:14:44,222 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:44,223 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:44,228 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:44,228 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:44,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:44,247 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_17=1} Honda state: {v_rep~unnamed0~0~true_17=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-14 02:14:44,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:44,253 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:44,284 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:44,284 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:44,288 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:44,305 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:44,305 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:44,305 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:44,305 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:44,306 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:44,306 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:44,306 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:44,306 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:44,306 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2019-01-14 02:14:44,306 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:44,306 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:44,307 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:14:44,316 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:14:44,323 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:14:44,330 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:14:44,380 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:44,380 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:44,381 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:14:44,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:44,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:44,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:44,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:44,385 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:44,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:44,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:44,395 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:14:44,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:44,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:44,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:44,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:44,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:44,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:44,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:44,405 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:44,406 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:44,406 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:44,407 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:44,408 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:44,408 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:44,409 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:44,409 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:44,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:44,782 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:14:44,782 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:14:44,825 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-14 02:14:44,826 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:14:44,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:44,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:44,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:14:44,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:44,827 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:44,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:44,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:44,918 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:14:44,918 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:14:44,931 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 37 states and 47 transitions. Complement of second has 5 states. [2019-01-14 02:14:44,931 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:14:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:44,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:44,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:14:44,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:44,932 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:44,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:44,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:44,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:45,031 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 5 loop predicates [2019-01-14 02:14:45,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:14:45,062 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 46 states and 60 transitions. Complement of second has 4 states. [2019-01-14 02:14:45,063 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:14:45,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:45,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:14:45,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:45,064 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:45,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:45,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:45,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:45,159 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:14:45,160 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:14:45,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12. Second operand 7 states. Result 63 states and 75 transitions. Complement of second has 8 states. [2019-01-14 02:14:45,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:45,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:14:45,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:14:45,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:45,243 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:45,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:45,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:45,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:45,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:45,325 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:45,325 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2019-01-14 02:14:45,325 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-01-14 02:14:45,450 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,450 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,451 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,451 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,457 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:45,506 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. Result 404 states and 547 transitions. Complement of second has 85 states 12 powerset states73 rank states. The highest rank that occured is 7 [2019-01-14 02:14:45,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:45,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-14 02:14:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2019-01-14 02:14:45,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2019-01-14 02:14:45,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:45,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2019-01-14 02:14:45,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:45,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2019-01-14 02:14:45,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:45,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2019-01-14 02:14:45,529 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2019-01-14 02:14:45,533 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2019-01-14 02:14:45,533 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 02:14:45,534 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 02:14:45,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2019-01-14 02:14:45,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:45,534 INFO L706 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2019-01-14 02:14:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2019-01-14 02:14:45,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2019-01-14 02:14:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 02:14:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2019-01-14 02:14:45,548 INFO L729 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-14 02:14:45,548 INFO L609 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2019-01-14 02:14:45,548 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2019-01-14 02:14:45,548 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2019-01-14 02:14:45,552 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2019-01-14 02:14:45,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:45,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:45,553 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:45,553 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2019-01-14 02:14:45,553 INFO L794 eck$LassoCheckResult]: Stem: 2722#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 2725#L15-2 assume !!(main_~c~0 > 0); 2753#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2742#L15-2 assume !!(main_~c~0 > 0); 2730#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2727#L15-2 [2019-01-14 02:14:45,553 INFO L796 eck$LassoCheckResult]: Loop: 2727#L15-2 assume !!(main_~c~0 > 0); 2728#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2779#L15-2 assume !!(main_~c~0 > 0); 2773#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2771#L15-2 assume !!(main_~c~0 > 0); 2765#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2764#L15-2 assume !!(main_~c~0 > 0); 2763#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2755#L15-2 assume !!(main_~c~0 > 0); 2734#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2747#L15-2 assume !!(main_~c~0 > 0); 2745#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 2744#L15-2 assume !!(main_~c~0 > 0); 2732#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 2727#L15-2 [2019-01-14 02:14:45,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:45,553 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2019-01-14 02:14:45,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:45,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:45,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2019-01-14 02:14:45,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:45,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:45,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,565 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:45,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:45,586 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2019-01-14 02:14:45,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:45,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:45,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:45,796 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-01-14 02:14:45,805 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:45,806 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:45,806 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:45,806 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:45,806 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:45,806 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:45,806 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:45,807 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:45,807 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2019-01-14 02:14:45,807 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:45,807 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:45,808 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:14:45,816 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:14:45,819 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:14:45,839 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:14:45,887 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:45,888 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:45,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:45,895 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:45,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:45,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:45,924 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:45,941 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:45,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:45,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:45,942 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:45,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:45,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:45,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:45,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:45,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2019-01-14 02:14:45,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:45,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:45,943 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:14:45,948 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:14:45,952 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:14:45,958 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:14:46,010 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:46,010 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:46,011 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:14:46,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:46,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:46,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:46,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:46,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:46,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:46,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:46,017 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:14:46,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:46,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:46,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:46,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:46,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:46,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:46,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:46,021 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:14:46,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:46,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:46,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:46,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:46,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:46,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:46,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:46,024 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:46,025 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:46,026 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:46,026 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:46,026 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:46,026 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:46,026 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:46,027 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:46,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:46,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:14:46,187 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:14:46,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-14 02:14:46,195 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:14:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:46,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:46,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:14:46,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:46,196 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:46,443 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:14:46,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:14:46,458 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 104 states and 145 transitions. Complement of second has 5 states. [2019-01-14 02:14:46,458 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:14:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:46,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:46,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:14:46,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:46,459 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,546 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:46,547 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 7 loop predicates [2019-01-14 02:14:46,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:14:46,561 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 146 states and 191 transitions. Complement of second has 4 states. [2019-01-14 02:14:46,565 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:14:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:46,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:14:46,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:46,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:46,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:46,687 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:14:46,687 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:14:46,727 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42. Second operand 9 states. Result 172 states and 219 transitions. Complement of second has 8 states. [2019-01-14 02:14:46,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:46,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:14:46,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:14:46,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:46,730 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:46,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:46,859 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:46,860 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-01-14 02:14:46,860 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2019-01-14 02:14:47,009 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,010 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,011 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,012 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,013 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,014 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,014 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,014 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,120 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,125 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,125 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,125 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,125 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,125 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,126 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,126 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,126 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,126 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,126 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,131 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,132 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,136 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,139 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,140 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,141 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,141 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,429 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,430 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,435 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,436 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,437 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:47,510 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. Result 1787 states and 2714 transitions. Complement of second has 144 states 16 powerset states128 rank states. The highest rank that occured is 7 [2019-01-14 02:14:47,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:47,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-14 02:14:47,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2019-01-14 02:14:47,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2019-01-14 02:14:47,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:47,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2019-01-14 02:14:47,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:47,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2019-01-14 02:14:47,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:47,524 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2019-01-14 02:14:47,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2019-01-14 02:14:47,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2019-01-14 02:14:47,554 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-14 02:14:47,554 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-14 02:14:47,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2019-01-14 02:14:47,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:47,554 INFO L706 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2019-01-14 02:14:47,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2019-01-14 02:14:47,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2019-01-14 02:14:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-01-14 02:14:47,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2019-01-14 02:14:47,595 INFO L729 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-14 02:14:47,595 INFO L609 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2019-01-14 02:14:47,596 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2019-01-14 02:14:47,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2019-01-14 02:14:47,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2019-01-14 02:14:47,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:47,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:47,605 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:47,606 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2019-01-14 02:14:47,606 INFO L794 eck$LassoCheckResult]: Stem: 5635#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 5640#L15-2 assume !!(main_~c~0 > 0); 5680#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5650#L15-2 assume !!(main_~c~0 > 0); 5647#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5644#L15-2 [2019-01-14 02:14:47,606 INFO L796 eck$LassoCheckResult]: Loop: 5644#L15-2 assume !!(main_~c~0 > 0); 5645#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5848#L15-2 assume !!(main_~c~0 > 0); 5778#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5776#L15-2 assume !!(main_~c~0 > 0); 5774#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5772#L15-2 assume !!(main_~c~0 > 0); 5768#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5769#L15-2 assume !!(main_~c~0 > 0); 5751#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5752#L15-2 assume !!(main_~c~0 > 0); 5748#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5749#L15-2 assume !!(main_~c~0 > 0); 5652#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5674#L15-2 assume !!(main_~c~0 > 0); 5653#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 5651#L15-2 assume !!(main_~c~0 > 0); 5649#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 5644#L15-2 [2019-01-14 02:14:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:47,606 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2019-01-14 02:14:47,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:47,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:47,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2019-01-14 02:14:47,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:47,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2019-01-14 02:14:47,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:47,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:47,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:14:47,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:47,859 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-01-14 02:14:47,886 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:47,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:47,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:47,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:47,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:47,889 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:47,889 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:47,889 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:47,889 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2019-01-14 02:14:47,889 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:47,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:47,891 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:14:47,895 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:14:47,902 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:14:47,909 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:14:47,958 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:47,958 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:47,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:47,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:47,990 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:47,990 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_21=0} Honda state: {v_rep~unnamed0~0~false_21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:47,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:47,996 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:48,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:48,025 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:48,047 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:48,048 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:48,048 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:48,048 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:48,049 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:48,049 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:48,049 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:48,049 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:48,049 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:48,049 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2019-01-14 02:14:48,049 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:48,049 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:48,050 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:14:48,060 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:14:48,067 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:14:48,078 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:14:48,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:48,167 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:48,167 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:14:48,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:48,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:48,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:48,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:48,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:48,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:48,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:48,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:14:48,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:48,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:48,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:48,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:48,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:48,179 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:48,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:48,186 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:14:48,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:48,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:48,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:48,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:48,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:48,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:48,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:48,192 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:48,193 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:48,194 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:48,197 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:48,197 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:48,197 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:48,198 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:48,198 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:48,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:48,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:48,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:48,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:48,497 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-14 02:14:48,497 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-14 02:14:48,515 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-14 02:14:48,523 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:14:48,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:48,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:48,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:14:48,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:48,524 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:48,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:48,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:48,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:49,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-14 02:14:49,114 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-14 02:14:49,131 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 276 states and 420 transitions. Complement of second has 5 states. [2019-01-14 02:14:49,133 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:14:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:49,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:14:49,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:49,136 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:49,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:49,262 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 9 loop predicates [2019-01-14 02:14:49,263 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-14 02:14:49,308 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 392 states and 537 transitions. Complement of second has 4 states. [2019-01-14 02:14:49,313 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:14:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:49,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:49,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:14:49,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:49,314 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:49,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:49,632 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-14 02:14:49,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-14 02:14:49,671 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137. Second operand 11 states. Result 455 states and 606 transitions. Complement of second has 8 states. [2019-01-14 02:14:49,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:49,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:14:49,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:14:49,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:49,673 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:49,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:49,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:49,833 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2019-01-14 02:14:49,833 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2019-01-14 02:14:50,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,245 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,245 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,245 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,253 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,253 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,256 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,260 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,263 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,357 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,358 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,359 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,365 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,366 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,367 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,368 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,374 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,375 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,378 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,379 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,380 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,384 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,385 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,386 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,389 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,389 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,389 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,390 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,394 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,394 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,394 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,395 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,396 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,608 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,609 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,610 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,611 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,612 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,613 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,614 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,615 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,616 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,617 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,618 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,619 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,620 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,621 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,622 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,623 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,624 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,625 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,626 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,736 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,736 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,737 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,738 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,739 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,740 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,741 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,742 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,743 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,743 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,743 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,744 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,745 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,746 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,747 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,748 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,748 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,748 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,749 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,749 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,749 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,750 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,750 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,750 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,750 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,750 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:50,783 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. Result 5484 states and 8953 transitions. Complement of second has 178 states 20 powerset states158 rank states. The highest rank that occured is 7 [2019-01-14 02:14:50,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:50,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 02:14:50,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2019-01-14 02:14:50,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2019-01-14 02:14:50,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:50,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2019-01-14 02:14:50,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:50,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2019-01-14 02:14:50,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:50,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2019-01-14 02:14:50,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2019-01-14 02:14:50,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2019-01-14 02:14:50,856 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 02:14:50,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:14:50,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2019-01-14 02:14:50,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:50,856 INFO L706 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2019-01-14 02:14:50,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2019-01-14 02:14:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2019-01-14 02:14:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-01-14 02:14:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2019-01-14 02:14:50,884 INFO L729 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-01-14 02:14:50,884 INFO L609 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2019-01-14 02:14:50,884 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2019-01-14 02:14:50,884 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2019-01-14 02:14:50,892 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2019-01-14 02:14:50,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:50,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:50,896 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:50,896 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2019-01-14 02:14:50,897 INFO L794 eck$LassoCheckResult]: Stem: 13388#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 13397#L15-2 assume !!(main_~c~0 > 0); 13474#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13413#L15-2 assume !!(main_~c~0 > 0); 13409#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13405#L15-2 [2019-01-14 02:14:50,897 INFO L796 eck$LassoCheckResult]: Loop: 13405#L15-2 assume !!(main_~c~0 > 0); 13406#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 14038#L15-2 assume !!(main_~c~0 > 0); 13902#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13900#L15-2 assume !!(main_~c~0 > 0); 13898#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13896#L15-2 assume !!(main_~c~0 > 0); 13894#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13890#L15-2 assume !!(main_~c~0 > 0); 13888#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13886#L15-2 assume !!(main_~c~0 > 0); 13882#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13883#L15-2 assume !!(main_~c~0 > 0); 13868#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13709#L15-2 assume !!(main_~c~0 > 0); 13866#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13867#L15-2 assume !!(main_~c~0 > 0); 13412#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13415#L15-2 assume !!(main_~c~0 > 0); 13414#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 13411#L15-2 assume !!(main_~c~0 > 0); 13408#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 13405#L15-2 [2019-01-14 02:14:50,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:50,897 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2019-01-14 02:14:50,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:50,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:50,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:50,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:50,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:50,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:50,915 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2019-01-14 02:14:50,915 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:50,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,919 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:50,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:50,936 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2019-01-14 02:14:50,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:50,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:50,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:50,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:51,319 WARN L181 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2019-01-14 02:14:51,328 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:51,328 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:51,328 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:51,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:51,329 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:51,329 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,329 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:51,329 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:51,329 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2019-01-14 02:14:51,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:51,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:51,331 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:14:51,337 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:14:51,340 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:14:51,378 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:14:51,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:51,428 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,432 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:51,432 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:51,451 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:51,452 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_23=1} Honda state: {v_rep~unnamed0~0~true_23=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,457 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:51,458 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:51,479 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 02:14:51,480 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_23=0} Honda state: {v_rep~unnamed0~0~false_23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,485 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:51,485 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:51,508 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:51,528 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:51,529 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:51,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:51,530 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:51,530 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:51,530 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:51,530 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:51,530 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:51,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:51,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2019-01-14 02:14:51,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:51,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:51,531 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:14:51,542 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:14:51,547 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:14:51,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:14:51,610 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:51,610 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:51,610 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:14:51,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:51,614 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:51,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:51,617 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:14:51,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:51,618 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:51,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:51,620 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:14:51,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:51,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:51,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:51,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:51,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:51,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:51,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:51,630 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:51,631 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:51,631 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:51,632 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:51,637 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:51,637 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:51,637 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-01-14 02:14:51,637 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:51,815 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-14 02:14:51,815 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-14 02:14:51,823 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-01-14 02:14:51,825 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:14:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-14 02:14:51,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:51,826 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:51,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:51,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-14 02:14:51,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-14 02:14:51,978 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 692 states and 1173 transitions. Complement of second has 5 states. [2019-01-14 02:14:51,980 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:14:51,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-14 02:14:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:51,981 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:52,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:52,181 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 11 loop predicates [2019-01-14 02:14:52,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-14 02:14:52,190 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 996 states and 1456 transitions. Complement of second has 4 states. [2019-01-14 02:14:52,191 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:14:52,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-14 02:14:52,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-14 02:14:52,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:52,192 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,360 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:52,362 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-14 02:14:52,362 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-14 02:14:52,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434. Second operand 13 states. Result 1149 states and 1623 transitions. Complement of second has 8 states. [2019-01-14 02:14:52,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:52,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:52,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 02:14:52,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-14 02:14:52,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:52,432 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:52,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:52,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:14:52,606 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 11 loop predicates [2019-01-14 02:14:52,606 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2019-01-14 02:14:52,905 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,906 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,906 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,907 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,908 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,908 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,908 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,909 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,909 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,909 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,910 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,911 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,912 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,913 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,914 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,915 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,916 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,917 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,918 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,919 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:52,920 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,052 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,053 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,054 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,055 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,055 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,056 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,057 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,058 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,059 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,060 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,061 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,062 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,063 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,064 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,065 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,066 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,067 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,067 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,067 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,067 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,068 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,068 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,068 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,068 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,068 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,069 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,070 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,071 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,072 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,073 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,073 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,074 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,075 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,076 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,077 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,077 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,077 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,078 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,079 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,216 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,220 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,221 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,223 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,224 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,225 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,226 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,227 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,228 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,229 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,230 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,231 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,232 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,233 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,234 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,235 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,236 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,237 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,238 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,240 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,241 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,242 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,243 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,244 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,245 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,246 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,246 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,246 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,246 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,246 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,247 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,248 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,249 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,250 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,251 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,252 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,252 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,252 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,252 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,252 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,253 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,253 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,254 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,255 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,256 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,256 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,256 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,439 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,440 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,442 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,443 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,444 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,446 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,447 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,448 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,476 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,477 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,478 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,479 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,480 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,481 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,482 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,489 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,489 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,490 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,490 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,490 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,491 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,492 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,493 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,494 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,497 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,498 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,500 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,501 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,502 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,690 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,691 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,692 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,694 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,695 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,697 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,700 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,701 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,702 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,703 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,704 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,705 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,706 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,707 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,708 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,709 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,710 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,711 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,711 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,711 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,712 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,712 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,712 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,713 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,714 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,714 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,715 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,716 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,716 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,717 WARN L278 uchiComplementFKVNwa]: big8 [2019-01-14 02:14:53,775 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. Result 14845 states and 25888 transitions. Complement of second has 212 states 24 powerset states188 rank states. The highest rank that occured is 7 [2019-01-14 02:14:53,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-14 02:14:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2019-01-14 02:14:53,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2019-01-14 02:14:53,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:53,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2019-01-14 02:14:53,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:53,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2019-01-14 02:14:53,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:53,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2019-01-14 02:14:53,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-01-14 02:14:53,918 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2019-01-14 02:14:53,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:14:53,919 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-01-14 02:14:53,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2019-01-14 02:14:53,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:14:53,919 INFO L706 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2019-01-14 02:14:53,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2019-01-14 02:14:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2019-01-14 02:14:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-01-14 02:14:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2019-01-14 02:14:53,980 INFO L729 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-01-14 02:14:53,980 INFO L609 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2019-01-14 02:14:53,980 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2019-01-14 02:14:53,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2019-01-14 02:14:53,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2019-01-14 02:14:53,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:14:53,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:14:53,988 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2019-01-14 02:14:53,988 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2019-01-14 02:14:53,988 INFO L794 eck$LassoCheckResult]: Stem: 33138#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~c~0, main_~n~0;havoc main_~c~0;havoc main_~n~0;main_~c~0 := 1;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0; 33155#L15-2 assume !!(main_~c~0 > 0); 33312#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33177#L15-2 assume !!(main_~c~0 > 0); 33174#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33171#L15-2 [2019-01-14 02:14:53,988 INFO L796 eck$LassoCheckResult]: Loop: 33171#L15-2 assume !!(main_~c~0 > 0); 33172#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34732#L15-2 assume !!(main_~c~0 > 0); 34321#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34320#L15-2 assume !!(main_~c~0 > 0); 34319#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34318#L15-2 assume !!(main_~c~0 > 0); 34317#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34316#L15-2 assume !!(main_~c~0 > 0); 34315#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34314#L15-2 assume !!(main_~c~0 > 0); 34313#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34312#L15-2 assume !!(main_~c~0 > 0); 34311#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 34033#L15-2 assume !!(main_~c~0 > 0); 34310#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34309#L15-2 assume !!(main_~c~0 > 0); 34308#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33681#L15-2 assume !!(main_~c~0 > 0); 34307#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 34305#L15-2 assume !!(main_~c~0 > 0); 33179#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33181#L15-2 assume !!(main_~c~0 > 0); 33180#L15 assume main_~n~0 > 100;main_~n~0 := main_~n~0 - 10;main_~c~0 := main_~c~0 - 1; 33178#L15-2 assume !!(main_~c~0 > 0); 33176#L15 assume !(main_~n~0 > 100);main_~n~0 := 11 + main_~n~0;main_~c~0 := 1 + main_~c~0; 33171#L15-2 [2019-01-14 02:14:53,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:53,988 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2019-01-14 02:14:53,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:53,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:53,990 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:53,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:53,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:53,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2019-01-14 02:14:53,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:53,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:53,998 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:53,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:54,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:54,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:54,011 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2019-01-14 02:14:54,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:14:54,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:14:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:54,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:14:54,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:14:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:14:54,382 WARN L181 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2019-01-14 02:14:54,393 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:54,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:54,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:54,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:54,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 02:14:54,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:54,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:54,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:54,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2019-01-14 02:14:54,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:54,395 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:54,396 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:14:54,407 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:14:54,413 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:14:54,416 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:14:54,460 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:54,460 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:54,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 02:14:54,466 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:54,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 02:14:54,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 02:14:54,511 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 02:14:54,513 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:14:54,513 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:14:54,513 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:14:54,513 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:14:54,513 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:14:54,513 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:14:54,513 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:14:54,514 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:14:54,514 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2019-01-14 02:14:54,514 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:14:54,514 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:14:54,515 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:14:54,523 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:14:54,527 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:14:54,537 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:14:54,591 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:14:54,591 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:14:54,592 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:14:54,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:54,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:54,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:54,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:54,594 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:14:54,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:14:54,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:14:54,596 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:14:54,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:14:54,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:14:54,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:14:54,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:14:54,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:14:54,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:14:54,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:14:54,598 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:14:54,599 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:14:54,599 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:14:54,599 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:14:54,599 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 02:14:54,600 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:14:54,600 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2019-01-14 02:14:54,600 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 02:14:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 02:14:54,792 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:14:54,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-14 02:14:54,806 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-01-14 02:14:54,806 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:14:54,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:54,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:54,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-14 02:14:54,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:54,807 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:54,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:54,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:54,892 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 02:14:54,892 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:14:54,892 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-14 02:14:54,908 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 1668 states and 3224 transitions. Complement of second has 5 states. [2019-01-14 02:14:54,909 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:14:54,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2019-01-14 02:14:54,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-14 02:14:54,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:54,910 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:54,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 02:14:55,031 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 6 loop predicates [2019-01-14 02:14:55,031 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-14 02:14:55,065 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 2364 states and 3787 transitions. Complement of second has 7 states. [2019-01-14 02:14:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:55,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:55,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2019-01-14 02:14:55,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-14 02:14:55,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:55,070 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 02:14:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:14:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:55,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:14:55,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:14:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-01-14 02:14:55,356 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2019-01-14 02:14:55,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2019-01-14 02:14:55,412 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357. Second operand 8 states. Result 3111 states and 5286 transitions. Complement of second has 12 states. [2019-01-14 02:14:55,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-01-14 02:14:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-14 02:14:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2019-01-14 02:14:55,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2019-01-14 02:14:55,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:55,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2019-01-14 02:14:55,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:55,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2019-01-14 02:14:55,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:14:55,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2019-01-14 02:14:55,431 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:14:55,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2019-01-14 02:14:55,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:14:55,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:14:55,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:14:55,431 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:14:55,432 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:14:55,432 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:14:55,432 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:14:55,432 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2019-01-14 02:14:55,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:14:55,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:14:55,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:14:55,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:14:55 BoogieIcfgContainer [2019-01-14 02:14:55,440 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:14:55,440 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:14:55,440 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:14:55,441 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:14:55,441 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:14:34" (3/4) ... [2019-01-14 02:14:55,445 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:14:55,445 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:14:55,446 INFO L168 Benchmark]: Toolchain (without parser) took 21398.77 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 362.8 MB). Free memory was 951.3 MB in the beginning and 998.8 MB in the end (delta: -47.4 MB). Peak memory consumption was 315.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:55,447 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:55,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:55,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:55,448 INFO L168 Benchmark]: Boogie Preprocessor took 24.92 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:55,448 INFO L168 Benchmark]: RCFGBuilder took 393.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:55,449 INFO L168 Benchmark]: BuchiAutomizer took 20622.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 104.0 MB). Peak memory consumption was 348.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:14:55,450 INFO L168 Benchmark]: Witness Printer took 4.69 ms. Allocated memory is still 1.4 GB. Free memory is still 998.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:14:55,454 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 308.52 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.50 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.92 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 393.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20622.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 244.3 MB). Free memory was 1.1 GB in the beginning and 998.8 MB in the end (delta: 104.0 MB). Peak memory consumption was 348.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.69 ms. Allocated memory is still 1.4 GB. Free memory is still 998.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (4 trivial, 4 deterministic, 9 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function c and consists of 3 locations. One deterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One deterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function c and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 211 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * n + 201 and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 5 locations. One nondeterministic module has affine ranking function n and consists of 7 locations. One nondeterministic module has affine ranking function n and consists of 9 locations. One nondeterministic module has affine ranking function n and consists of 11 locations. One nondeterministic module has affine ranking function n and consists of 13 locations. One nondeterministic module has affine ranking function c and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.5s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 8.8s. Construction of modules took 1.9s. Büchi inclusion checks took 9.0s. Highest rank in rank-based complementation 7. Minimization of det autom 1. Minimization of nondet autom 16. Automata minimization 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 3169 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1604 states and ocurred in iteration 13. Nontrivial modules had stage [4, 0, 3, 1, 5]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 254/414 HoareTripleCheckerStatistics: 213 SDtfs, 253 SDslu, 127 SDs, 0 SdLazy, 376 SolverSat, 171 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT10 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax160 hnf98 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq151 hnf94 smp97 dnf100 smp100 tf112 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 13 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...