./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 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-91b1670 [2018-11-28 23:13:38,789 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:13:38,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:13:38,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:13:38,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:13:38,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:13:38,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:13:38,807 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:13:38,809 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:13:38,810 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:13:38,811 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:13:38,811 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:13:38,813 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:13:38,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:13:38,815 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:13:38,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:13:38,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:13:38,819 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:13:38,821 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:13:38,823 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:13:38,824 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:13:38,825 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:13:38,828 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:13:38,828 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:13:38,828 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:13:38,829 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:13:38,831 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:13:38,831 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:13:38,833 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:13:38,834 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:13:38,834 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:13:38,835 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:13:38,835 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:13:38,835 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:13:38,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:13:38,837 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:13:38,837 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:13:38,858 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:13:38,858 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:13:38,860 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:13:38,860 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:13:38,860 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:13:38,860 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:13:38,860 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:13:38,861 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:13:38,861 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:13:38,861 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:13:38,862 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:13:38,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:13:38,862 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:13:38,862 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:13:38,862 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:13:38,862 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:13:38,863 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:13:38,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:13:38,865 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:13:38,866 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:13:38,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:13:38,866 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:13:38,866 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:13:38,868 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:13:38,868 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 [2018-11-28 23:13:38,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:13:38,922 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:13:38,926 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:13:38,928 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:13:38,928 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:13:38,929 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 [2018-11-28 23:13:38,990 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e75c5a2/7e085b158aea4018b226b4f584b5632d/FLAG60745e718 [2018-11-28 23:13:39,452 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:13:39,453 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:13:39,460 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e75c5a2/7e085b158aea4018b226b4f584b5632d/FLAG60745e718 [2018-11-28 23:13:39,833 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51e75c5a2/7e085b158aea4018b226b4f584b5632d [2018-11-28 23:13:39,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:13:39,839 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:13:39,840 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:39,840 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:13:39,844 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:13:39,845 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:39" (1/1) ... [2018-11-28 23:13:39,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac9139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:39, skipping insertion in model container [2018-11-28 23:13:39,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:13:39" (1/1) ... [2018-11-28 23:13:39,858 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:13:39,878 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:13:40,092 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:40,100 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:13:40,122 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:13:40,141 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:13:40,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40 WrapperNode [2018-11-28 23:13:40,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:13:40,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:40,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:13:40,144 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:13:40,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,162 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:13:40,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:13:40,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:13:40,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:13:40,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,210 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,221 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... [2018-11-28 23:13:40,222 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:13:40,223 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:13:40,224 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:13:40,224 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:13:40,225 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:40,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:13:40,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:13:40,694 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:13:40,694 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 23:13:40,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:40 BoogieIcfgContainer [2018-11-28 23:13:40,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:13:40,697 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:13:40,697 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:13:40,703 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:13:40,705 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:40,705 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:13:39" (1/3) ... [2018-11-28 23:13:40,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@166aeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:40, skipping insertion in model container [2018-11-28 23:13:40,709 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:40,709 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:13:40" (2/3) ... [2018-11-28 23:13:40,710 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@166aeae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:13:40, skipping insertion in model container [2018-11-28 23:13:40,711 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:13:40,711 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:40" (3/3) ... [2018-11-28 23:13:40,713 INFO L375 chiAutomizerObserver]: Analyzing ICFG McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c [2018-11-28 23:13:40,780 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:13:40,781 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:13:40,781 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:13:40,781 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:13:40,781 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:13:40,781 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:13:40,782 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:13:40,782 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:13:40,782 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:13:40,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:13:40,850 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:40,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:40,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:40,858 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:13:40,859 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:40,859 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:13:40,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2018-11-28 23:13:40,860 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:40,860 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:40,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:40,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:13:40,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:40,871 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 [2018-11-28 23:13:40,871 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 [2018-11-28 23:13:40,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:40,879 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-28 23:13:40,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:40,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:40,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:40,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:40,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:40,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2018-11-28 23:13:40,981 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:40,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:40,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:40,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:40,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2018-11-28 23:13:40,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:41,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:41,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:41,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:41,156 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-28 23:13:41,260 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:41,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:41,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:41,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:41,262 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:41,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:41,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:41,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:41,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:13:41,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:41,265 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:41,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:41,555 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:41,568 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:41,568 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:41,592 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:41,593 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 [2018-11-28 23:13:41,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:41,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:41,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:41,622 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 [2018-11-28 23:13:41,627 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:41,628 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:41,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:41,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:41,675 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:41,677 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:41,677 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:41,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:41,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:41,678 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:41,678 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:41,678 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:41,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:41,678 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration1_Loop [2018-11-28 23:13:41,678 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:41,678 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:41,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:41,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,172 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:42,177 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:42,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:42,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:42,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:42,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:42,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:42,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:42,188 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:42,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:42,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:42,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:42,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:42,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:42,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:42,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:42,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:42,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:42,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:42,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:42,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:42,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:42,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:42,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:42,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:42,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:42,225 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:42,233 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:42,233 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:42,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:42,236 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:42,236 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:42,237 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:42,239 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:42,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:42,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:42,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:42,406 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 [2018-11-28 23:13:42,408 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2018-11-28 23:13:42,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. [2018-11-28 23:13:42,500 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 [2018-11-28 23:13:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2018-11-28 23:13:42,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:13:42,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:42,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:13:42,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:42,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:13:42,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:42,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2018-11-28 23:13:42,512 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:42,517 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2018-11-28 23:13:42,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:13:42,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2018-11-28 23:13:42,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2018-11-28 23:13:42,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:42,520 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:13:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2018-11-28 23:13:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-11-28 23:13:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:13:42,553 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:13:42,554 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:13:42,554 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:13:42,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2018-11-28 23:13:42,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:42,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:42,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:42,555 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-28 23:13:42,555 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:42,556 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 [2018-11-28 23:13:42,556 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 [2018-11-28 23:13:42,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,556 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-28 23:13:42,556 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:42,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:42,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2018-11-28 23:13:42,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:42,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:42,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2018-11-28 23:13:42,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:42,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:42,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:42,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:42,639 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:42,639 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:42,639 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:42,640 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:42,640 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:42,640 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,640 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:42,640 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:42,641 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-28 23:13:42,641 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:42,641 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:42,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,760 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:42,761 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,765 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:42,765 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:42,805 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:42,806 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 [2018-11-28 23:13:42,811 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:42,811 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,840 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:42,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:42,864 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:42,865 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:42,866 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:42,866 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:42,866 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:42,866 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:42,866 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:42,866 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:42,867 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:42,867 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration2_Loop [2018-11-28 23:13:42,867 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:42,867 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:42,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:42,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,173 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-11-28 23:13:43,400 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:43,401 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:43,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:43,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:43,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:43,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:43,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:43,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:43,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:43,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:43,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:43,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:43,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:43,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:43,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:43,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:43,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:43,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:43,423 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:43,428 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:43,428 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:43,429 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:43,429 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:43,430 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:43,430 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:13:43,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:43,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:43,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:43,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:43,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:43,564 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:43,564 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-28 23:13:43,582 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. [2018-11-28 23:13:43,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:13:43,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:13:43,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:13:43,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-28 23:13:43,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:43,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. [2018-11-28 23:13:43,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:43,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:13:43,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:43,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:13:43,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2018-11-28 23:13:43,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:43,590 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:13:43,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2018-11-28 23:13:43,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-28 23:13:43,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:43,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2018-11-28 23:13:43,592 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:13:43,592 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2018-11-28 23:13:43,592 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:13:43,592 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2018-11-28 23:13:43,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:13:43,593 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:43,594 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:43,594 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:43,594 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:43,594 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 [2018-11-28 23:13:43,594 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 [2018-11-28 23:13:43,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,595 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2018-11-28 23:13:43,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:43,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2018-11-28 23:13:43,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:43,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:43,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2018-11-28 23:13:43,615 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:43,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:43,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:43,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:43,688 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:43,688 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:43,688 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:43,688 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:43,688 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:43,689 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:43,689 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:43,689 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:43,689 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:13:43,689 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:43,689 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:43,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,817 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:43,817 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 [2018-11-28 23:13:43,821 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:43,821 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:43,842 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:43,842 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 [2018-11-28 23:13:43,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:43,847 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 [2018-11-28 23:13:43,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:43,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:43,893 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:43,895 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:43,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:43,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:43,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:43,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:43,896 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:43,896 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:43,896 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:43,896 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration3_Loop [2018-11-28 23:13:43,896 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:43,896 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:43,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:43,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,035 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:44,035 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:44,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:44,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:44,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:44,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:44,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:44,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:44,041 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:44,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:44,045 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:44,048 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:44,048 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:44,049 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:44,049 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:44,049 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:44,049 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:13:44,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:44,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:44,113 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:44,113 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:13:44,136 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. [2018-11-28 23:13:44,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:44,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:13:44,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:13:44,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,139 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:44,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,216 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:44,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:44,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:13:44,296 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. [2018-11-28 23:13:44,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:44,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2018-11-28 23:13:44,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:13:44,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,299 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:44,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:44,389 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:44,389 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2018-11-28 23:13:44,436 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. [2018-11-28 23:13:44,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:44,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:44,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2018-11-28 23:13:44,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2018-11-28 23:13:44,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2018-11-28 23:13:44,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,442 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. [2018-11-28 23:13:44,443 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:44,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2018-11-28 23:13:44,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:13:44,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:13:44,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2018-11-28 23:13:44,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:44,446 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2018-11-28 23:13:44,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2018-11-28 23:13:44,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2018-11-28 23:13:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:13:44,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-11-28 23:13:44,447 INFO L728 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:13:44,448 INFO L608 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-11-28 23:13:44,448 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:13:44,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2018-11-28 23:13:44,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:44,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:44,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:44,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-28 23:13:44,449 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:44,449 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 [2018-11-28 23:13:44,449 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 [2018-11-28 23:13:44,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2018-11-28 23:13:44,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:44,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:44,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2018-11-28 23:13:44,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:44,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:44,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,463 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-28 23:13:44,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:44,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:44,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:44,528 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:44,528 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:44,528 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:44,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:44,529 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:44,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:44,530 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:44,530 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:13:44,530 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:44,530 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:44,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,637 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:44,637 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 [2018-11-28 23:13:44,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:44,672 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:44,672 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 [2018-11-28 23:13:44,678 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,678 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:44,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:44,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:44,712 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 [2018-11-28 23:13:44,734 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:44,734 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 [2018-11-28 23:13:44,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:44,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:44,781 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:44,783 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:44,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:44,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:44,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:44,783 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:44,783 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:44,783 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:44,783 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:44,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration4_Loop [2018-11-28 23:13:44,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:44,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:44,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:44,868 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:44,868 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:44,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:44,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:44,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:44,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:44,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:44,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:44,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:44,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:44,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:44,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:44,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:44,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:44,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:44,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:44,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:44,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:44,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:44,880 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:44,883 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:44,883 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:13:44,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:44,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:44,884 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:44,884 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-28 23:13:44,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:44,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:44,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:44,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:44,945 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 [2018-11-28 23:13:44,945 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2018-11-28 23:13:44,956 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. [2018-11-28 23:13:44,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:44,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3 transitions. [2018-11-28 23:13:44,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 2 letters. [2018-11-28 23:13:44,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 3 letters. Loop has 2 letters. [2018-11-28 23:13:44,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 3 transitions. Stem has 1 letters. Loop has 4 letters. [2018-11-28 23:13:44,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:44,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. [2018-11-28 23:13:44,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:44,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 9 states and 13 transitions. [2018-11-28 23:13:44,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:13:44,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 23:13:44,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 13 transitions. [2018-11-28 23:13:44,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:44,963 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 13 transitions. [2018-11-28 23:13:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 13 transitions. [2018-11-28 23:13:44,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-28 23:13:44,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:13:44,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 12 transitions. [2018-11-28 23:13:44,964 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:13:44,964 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 12 transitions. [2018-11-28 23:13:44,964 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:13:44,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 12 transitions. [2018-11-28 23:13:44,965 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-28 23:13:44,965 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:44,965 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:44,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1] [2018-11-28 23:13:44,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:13:44,968 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 [2018-11-28 23:13:44,968 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 [2018-11-28 23:13:44,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:44,968 INFO L82 PathProgramCache]: Analyzing trace with hash 963335, now seen corresponding path program 2 times [2018-11-28 23:13:44,968 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:44,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:44,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:45,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:13:45,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-28 23:13:45,015 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:45,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:45,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1436, now seen corresponding path program 2 times [2018-11-28 23:13:45,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:45,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:45,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:45,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:45,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:45,062 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:45,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:45,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:45,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:45,062 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:45,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:45,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:45,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:45,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:13:45,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:45,063 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:45,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,153 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:45,153 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 [2018-11-28 23:13:45,158 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:45,159 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:45,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:45,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:45,220 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:45,220 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 [2018-11-28 23:13:45,241 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:45,242 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 [2018-11-28 23:13:45,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:45,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:45,304 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:45,306 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:45,306 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:45,306 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:45,306 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:45,307 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:45,307 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:45,307 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:45,307 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:45,307 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration5_Loop [2018-11-28 23:13:45,307 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:45,307 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:45,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:45,451 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:45,451 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:45,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:45,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:45,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:45,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:45,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:45,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:45,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:45,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:45,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:45,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:45,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:45,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:45,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:45,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:45,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:45,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:45,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:45,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:45,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:45,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:45,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:45,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:45,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:45,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:45,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:45,469 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:45,472 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:45,472 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:13:45,473 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:45,473 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:45,473 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:45,473 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 211 Supporting invariants [] [2018-11-28 23:13:45,474 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:45,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:45,627 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:45,627 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:13:45,638 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. [2018-11-28 23:13:45,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 23:13:45,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:13:45,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:45,660 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:45,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:45,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:45,741 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:13:45,815 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. [2018-11-28 23:13:45,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:45,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:13:45,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:45,819 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:45,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:45,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:45,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:45,954 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-28 23:13:45,954 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 12 transitions. cyclomatic complexity: 6 Second operand 3 states. [2018-11-28 23:13:45,966 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. [2018-11-28 23:13:45,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-28 23:13:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:13:45,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-28 23:13:45,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:45,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2018-11-28 23:13:45,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:45,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 4 letters. Loop has 4 letters. [2018-11-28 23:13:45,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:45,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2018-11-28 23:13:45,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-28 23:13:45,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 12 states and 16 transitions. [2018-11-28 23:13:45,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:13:45,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:13:45,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2018-11-28 23:13:45,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:45,973 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2018-11-28 23:13:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2018-11-28 23:13:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2018-11-28 23:13:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2018-11-28 23:13:45,974 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2018-11-28 23:13:45,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:13:45,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:13:45,979 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 4 states. [2018-11-28 23:13:46,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:46,029 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-11-28 23:13:46,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:13:46,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. [2018-11-28 23:13:46,032 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:13:46,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 8 states and 10 transitions. [2018-11-28 23:13:46,033 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:13:46,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:13:46,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2018-11-28 23:13:46,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:46,033 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-28 23:13:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2018-11-28 23:13:46,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-11-28 23:13:46,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-11-28 23:13:46,034 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:13:46,035 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-11-28 23:13:46,035 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-28 23:13:46,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2018-11-28 23:13:46,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-28 23:13:46,035 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:46,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:46,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 1, 1, 1] [2018-11-28 23:13:46,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2018-11-28 23:13:46,036 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 [2018-11-28 23:13:46,036 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 [2018-11-28 23:13:46,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,037 INFO L82 PathProgramCache]: Analyzing trace with hash 925824930, now seen corresponding path program 3 times [2018-11-28 23:13:46,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:46,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,038 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:46,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1380409, now seen corresponding path program 1 times [2018-11-28 23:13:46,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:46,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1848815782, now seen corresponding path program 4 times [2018-11-28 23:13:46,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:46,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:46,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:46,141 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:46,142 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:46,142 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:46,142 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:46,142 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:46,142 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:46,143 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:46,143 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:46,143 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-28 23:13:46,143 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:46,143 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:46,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,257 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:46,257 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:46,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:46,261 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 [2018-11-28 23:13:46,287 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:46,287 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:46,316 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:46,336 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:46,336 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:46,336 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:46,336 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:46,336 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:46,336 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:46,336 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:46,336 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:46,336 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration6_Loop [2018-11-28 23:13:46,337 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:46,337 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:46,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:46,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:46,447 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:46,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:46,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:46,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:46,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:46,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:46,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:46,450 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:46,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:46,453 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:46,456 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:46,456 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-28 23:13:46,456 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:46,456 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:46,456 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:46,456 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 201 Supporting invariants [] [2018-11-28 23:13:46,457 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:46,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:46,565 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:13:46,565 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:13:46,582 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. [2018-11-28 23:13:46,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2018-11-28 23:13:46,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:13:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:46,587 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:46,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:46,675 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:13:46,675 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:13:46,704 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. [2018-11-28 23:13:46,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:46,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:46,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:13:46,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:46,707 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:46,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:46,772 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-28 23:13:46,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:13:46,785 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. [2018-11-28 23:13:46,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:46,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2018-11-28 23:13:46,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:13:46,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:46,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:46,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:46,907 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 [2018-11-28 23:13:46,907 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:13:46,934 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. [2018-11-28 23:13:46,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:46,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:13:46,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:46,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:46,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:46,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:46,992 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 [2018-11-28 23:13:46,994 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:13:47,144 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 [2018-11-28 23:13:47,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:47,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:13:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-28 23:13:47,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:13:47,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:47,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:13:47,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:47,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:13:47,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:47,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 96 transitions. [2018-11-28 23:13:47,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-28 23:13:47,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 27 states and 38 transitions. [2018-11-28 23:13:47,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:13:47,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 23:13:47,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 38 transitions. [2018-11-28 23:13:47,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:47,163 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 38 transitions. [2018-11-28 23:13:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 38 transitions. [2018-11-28 23:13:47,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 15. [2018-11-28 23:13:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-28 23:13:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 22 transitions. [2018-11-28 23:13:47,167 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 23:13:47,167 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 22 transitions. [2018-11-28 23:13:47,168 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-28 23:13:47,170 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 22 transitions. [2018-11-28 23:13:47,171 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:13:47,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:47,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:47,173 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 1, 1] [2018-11-28 23:13:47,173 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 23:13:47,174 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 [2018-11-28 23:13:47,174 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 [2018-11-28 23:13:47,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:47,174 INFO L82 PathProgramCache]: Analyzing trace with hash 659527871, now seen corresponding path program 5 times [2018-11-28 23:13:47,174 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:47,174 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:47,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:47,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:47,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:47,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:47,264 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 [2018-11-28 23:13:47,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 23:13:47,294 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-28 23:13:47,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 23:13:47,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:47,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:47,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:47,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-28 23:13:47,319 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:13:47,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:47,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 2 times [2018-11-28 23:13:47,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:47,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:47,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:47,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:47,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:47,425 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:47,425 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:47,425 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:47,425 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:47,425 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:47,426 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:47,426 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:47,426 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:47,426 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-28 23:13:47,426 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:47,426 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:47,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,644 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:47,644 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 [2018-11-28 23:13:47,650 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:47,650 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:47,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:47,670 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 [2018-11-28 23:13:47,675 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:47,675 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 [2018-11-28 23:13:47,700 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:47,700 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:47,773 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:47,775 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:47,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:47,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:47,775 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:47,775 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:47,775 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:47,775 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:47,775 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:47,775 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration7_Loop [2018-11-28 23:13:47,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:47,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:47,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:47,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:47,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:47,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:47,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:47,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:47,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:47,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:47,868 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:47,868 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:47,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:47,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:47,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:47,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:47,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:47,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:47,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:47,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:47,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:47,883 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:47,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:47,885 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:47,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:47,885 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:47,886 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:47,887 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:47,888 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:47,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:47,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:47,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:47,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:47,977 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:13:47,977 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 22 transitions. cyclomatic complexity: 9 Second operand 5 states. [2018-11-28 23:13:48,008 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. [2018-11-28 23:13:48,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:13:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-11-28 23:13:48,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-28 23:13:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 14 letters. Loop has 6 letters. [2018-11-28 23:13:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:48,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 12 letters. [2018-11-28 23:13:48,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:48,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 87 transitions. [2018-11-28 23:13:48,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:13:48,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 54 states and 75 transitions. [2018-11-28 23:13:48,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2018-11-28 23:13:48,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2018-11-28 23:13:48,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 75 transitions. [2018-11-28 23:13:48,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:48,017 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 75 transitions. [2018-11-28 23:13:48,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 75 transitions. [2018-11-28 23:13:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-28 23:13:48,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-28 23:13:48,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2018-11-28 23:13:48,022 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 66 transitions. [2018-11-28 23:13:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 23:13:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-28 23:13:48,022 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand 5 states. [2018-11-28 23:13:48,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:48,055 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-11-28 23:13:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:13:48,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 60 transitions. [2018-11-28 23:13:48,058 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:13:48,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 33 states and 44 transitions. [2018-11-28 23:13:48,060 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:13:48,060 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2 [2018-11-28 23:13:48,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 44 transitions. [2018-11-28 23:13:48,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:48,060 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2018-11-28 23:13:48,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 44 transitions. [2018-11-28 23:13:48,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2018-11-28 23:13:48,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-28 23:13:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2018-11-28 23:13:48,063 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:13:48,063 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2018-11-28 23:13:48,063 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-28 23:13:48,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2018-11-28 23:13:48,064 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-28 23:13:48,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:48,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:48,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 2, 2, 1] [2018-11-28 23:13:48,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1] [2018-11-28 23:13:48,065 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 [2018-11-28 23:13:48,065 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 [2018-11-28 23:13:48,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:48,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1791617062, now seen corresponding path program 6 times [2018-11-28 23:13:48,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:48,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:48,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:48,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1326573462, now seen corresponding path program 3 times [2018-11-28 23:13:48,076 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:48,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:48,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:48,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:48,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash 709032111, now seen corresponding path program 7 times [2018-11-28 23:13:48,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:48,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:48,175 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:48,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 23:13:48,175 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 [2018-11-28 23:13:48,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:48,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 41 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:48,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 23:13:48,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-28 23:13:48,283 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:48,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:48,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:48,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:48,284 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:48,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:48,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:48,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:48,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-28 23:13:48,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:48,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:48,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,403 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:48,403 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 [2018-11-28 23:13:48,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:48,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:48,435 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:48,435 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) [2018-11-28 23:13:48,443 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:48,444 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:48,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:48,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:48,555 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:48,557 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:48,557 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:48,557 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:48,557 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:48,557 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:48,557 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:48,557 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:48,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:48,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration8_Loop [2018-11-28 23:13:48,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:48,558 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:48,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:48,641 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:48,642 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:48,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:48,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:48,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:48,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:48,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:48,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:48,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:48,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:48,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:48,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:48,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:48,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:48,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:48,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:48,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:48,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:48,656 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:48,658 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:48,658 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:48,659 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:48,659 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:48,659 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:48,659 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:48,659 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:48,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:48,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:48,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:49,073 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:13:49,073 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:13:49,102 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. [2018-11-28 23:13:49,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:13:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:13:49,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:13:49,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:49,107 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:49,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:49,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:49,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:49,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:49,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:13:49,181 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:13:49,234 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. [2018-11-28 23:13:49,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:49,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:13:49,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 6 transitions. [2018-11-28 23:13:49,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 6 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:13:49,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:49,237 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:49,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:49,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:49,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:49,327 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-28 23:13:49,327 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 30 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-11-28 23:13:49,365 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. [2018-11-28 23:13:49,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:49,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:13:49,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-28 23:13:49,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:13:49,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:49,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 16 letters. Loop has 6 letters. [2018-11-28 23:13:49,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:49,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 10 letters. Loop has 12 letters. [2018-11-28 23:13:49,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:49,371 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 99 transitions. [2018-11-28 23:13:49,374 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 22 [2018-11-28 23:13:49,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 52 states and 71 transitions. [2018-11-28 23:13:49,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2018-11-28 23:13:49,378 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2018-11-28 23:13:49,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2018-11-28 23:13:49,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:49,379 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2018-11-28 23:13:49,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2018-11-28 23:13:49,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-11-28 23:13:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-28 23:13:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2018-11-28 23:13:49,383 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 58 transitions. [2018-11-28 23:13:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 23:13:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-28 23:13:49,383 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 7 states. [2018-11-28 23:13:49,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:49,421 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2018-11-28 23:13:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 23:13:49,423 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 85 transitions. [2018-11-28 23:13:49,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-28 23:13:49,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 51 states and 67 transitions. [2018-11-28 23:13:49,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2 [2018-11-28 23:13:49,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:13:49,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 67 transitions. [2018-11-28 23:13:49,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:49,427 INFO L705 BuchiCegarLoop]: Abstraction has 51 states and 67 transitions. [2018-11-28 23:13:49,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 67 transitions. [2018-11-28 23:13:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 33. [2018-11-28 23:13:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:13:49,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2018-11-28 23:13:49,430 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:13:49,430 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 43 transitions. [2018-11-28 23:13:49,430 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-28 23:13:49,430 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 43 transitions. [2018-11-28 23:13:49,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-28 23:13:49,431 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:49,431 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:49,432 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:49,432 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 2, 2] [2018-11-28 23:13:49,432 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 [2018-11-28 23:13:49,432 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 [2018-11-28 23:13:49,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,432 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 4 times [2018-11-28 23:13:49,433 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:49,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:49,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1687002897, now seen corresponding path program 4 times [2018-11-28 23:13:49,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:49,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:49,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:49,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-28 23:13:49,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:13:49,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:13:49,500 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-28 23:13:49,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:13:49,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:13:49,500 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-28 23:13:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:13:49,521 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-28 23:13:49,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 23:13:49,523 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2018-11-28 23:13:49,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:13:49,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 39 states and 47 transitions. [2018-11-28 23:13:49,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:13:49,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:13:49,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 47 transitions. [2018-11-28 23:13:49,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:49,525 INFO L705 BuchiCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-28 23:13:49,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 47 transitions. [2018-11-28 23:13:49,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-28 23:13:49,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 23:13:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2018-11-28 23:13:49,529 INFO L728 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:13:49,529 INFO L608 BuchiCegarLoop]: Abstraction has 33 states and 41 transitions. [2018-11-28 23:13:49,529 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-28 23:13:49,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 41 transitions. [2018-11-28 23:13:49,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-28 23:13:49,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:49,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:49,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:49,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [5, 3, 2] [2018-11-28 23:13:49,534 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 [2018-11-28 23:13:49,534 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 [2018-11-28 23:13:49,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,534 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 5 times [2018-11-28 23:13:49,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:49,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,538 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:49,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,555 INFO L82 PathProgramCache]: Analyzing trace with hash 2007111828, now seen corresponding path program 5 times [2018-11-28 23:13:49,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:49,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:49,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:49,574 INFO L82 PathProgramCache]: Analyzing trace with hash -254222659, now seen corresponding path program 8 times [2018-11-28 23:13:49,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:49,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:49,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:49,755 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2018-11-28 23:13:49,767 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:49,767 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:49,767 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:49,767 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:49,767 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:49,768 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:49,768 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:49,768 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:49,768 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-11-28 23:13:49,768 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:49,769 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:49,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:49,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:49,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:49,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:49,967 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:49,967 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 [2018-11-28 23:13:49,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:49,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:49,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:49,992 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) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:50,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:50,000 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:50,028 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:50,028 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:50,033 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:50,051 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:50,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:50,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:50,052 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:50,052 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:50,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:50,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:50,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:50,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration10_Loop [2018-11-28 23:13:50,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:50,052 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:50,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:50,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:50,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:50,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:50,139 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:50,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:50,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:50,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:50,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:50,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:50,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:50,145 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:50,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:50,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:50,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:50,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:50,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:50,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:50,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:50,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:50,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:50,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:50,160 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:50,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:50,163 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:50,163 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:50,164 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:50,164 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:50,164 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:50,164 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:50,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:50,596 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 [2018-11-28 23:13:50,596 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:13:50,645 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. [2018-11-28 23:13:50,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:50,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:13:50,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:50,650 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:50,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:50,905 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 [2018-11-28 23:13:50,905 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:13:50,920 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. [2018-11-28 23:13:50,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:50,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:50,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:13:50,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:50,921 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:50,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:50,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:51,111 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 [2018-11-28 23:13:51,111 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:13:51,118 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. [2018-11-28 23:13:51,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:51,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:13:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:51,121 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:51,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:51,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:51,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:51,211 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:51,212 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 [2018-11-28 23:13:51,212 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:13:51,280 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. [2018-11-28 23:13:51,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:51,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:13:51,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:13:51,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:51,281 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:51,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:51,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:51,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:51,352 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 [2018-11-28 23:13:51,352 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 33 states and 41 transitions. cyclomatic complexity: 12 Second operand 7 states. [2018-11-28 23:13:51,447 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,450 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,451 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,451 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,452 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,514 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,518 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,518 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:51,529 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 [2018-11-28 23:13:51,530 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 [2018-11-28 23:13:51,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-28 23:13:51,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2018-11-28 23:13:51,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 10 letters. [2018-11-28 23:13:51,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:51,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 15 letters. Loop has 10 letters. [2018-11-28 23:13:51,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:51,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 29 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-28 23:13:51,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:51,539 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 404 states and 547 transitions. [2018-11-28 23:13:51,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2018-11-28 23:13:51,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 404 states to 145 states and 187 transitions. [2018-11-28 23:13:51,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2018-11-28 23:13:51,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-28 23:13:51,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 187 transitions. [2018-11-28 23:13:51,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:51,549 INFO L705 BuchiCegarLoop]: Abstraction has 145 states and 187 transitions. [2018-11-28 23:13:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 187 transitions. [2018-11-28 23:13:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 96. [2018-11-28 23:13:51,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-28 23:13:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 129 transitions. [2018-11-28 23:13:51,560 INFO L728 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 23:13:51,560 INFO L608 BuchiCegarLoop]: Abstraction has 96 states and 129 transitions. [2018-11-28 23:13:51,560 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-28 23:13:51,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 96 states and 129 transitions. [2018-11-28 23:13:51,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-28 23:13:51,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:51,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:51,566 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:51,566 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 4, 3] [2018-11-28 23:13:51,566 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 [2018-11-28 23:13:51,566 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 [2018-11-28 23:13:51,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 6 times [2018-11-28 23:13:51,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:51,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:51,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:51,582 INFO L82 PathProgramCache]: Analyzing trace with hash 822111324, now seen corresponding path program 6 times [2018-11-28 23:13:51,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:51,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:51,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:51,599 INFO L82 PathProgramCache]: Analyzing trace with hash 128316933, now seen corresponding path program 9 times [2018-11-28 23:13:51,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:51,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:51,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:51,769 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2018-11-28 23:13:51,797 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:51,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:51,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:51,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:51,797 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:51,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:51,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:51,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:51,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-11-28 23:13:51,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:51,798 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:51,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,874 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:51,874 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 [2018-11-28 23:13:51,880 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:51,880 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 [2018-11-28 23:13:51,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:51,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:51,907 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:51,925 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:51,925 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:51,925 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:51,925 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:51,925 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:51,925 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:51,925 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:51,925 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:51,925 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration11_Loop [2018-11-28 23:13:51,925 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:51,926 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:51,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:51,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:51,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:51,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:52,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:52,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:52,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:52,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:52,002 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:52,002 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:52,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:52,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:52,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:52,006 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:52,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:52,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:52,008 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:52,008 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:52,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:52,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:52,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:52,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:52,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:52,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:52,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:52,011 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:52,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:52,026 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:52,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:52,034 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:52,035 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:52,035 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:52,035 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:52,035 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:52,035 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:52,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:52,160 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-11-28 23:13:52,162 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:13:52,168 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. [2018-11-28 23:13:52,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:52,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:13:52,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:52,170 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:52,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:52,419 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 [2018-11-28 23:13:52,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:13:52,447 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. [2018-11-28 23:13:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:52,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:52,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:52,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:13:52,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:52,449 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:52,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,556 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:52,557 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 [2018-11-28 23:13:52,557 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:13:52,577 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. [2018-11-28 23:13:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:52,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:13:52,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:52,582 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:52,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:52,695 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 [2018-11-28 23:13:52,695 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:13:52,735 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. [2018-11-28 23:13:52,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:13:52,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:13:52,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:52,737 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:52,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:52,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:52,871 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 [2018-11-28 23:13:52,872 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 96 states and 129 transitions. cyclomatic complexity: 42 Second operand 9 states. [2018-11-28 23:13:53,013 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,013 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,016 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,016 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,016 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,016 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,017 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,017 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,021 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,022 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,022 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,022 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,202 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,203 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,203 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,203 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,207 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,207 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,207 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,207 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,207 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,210 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,211 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,211 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,211 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,212 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,212 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,212 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,217 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,218 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,219 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,475 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,475 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,475 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,475 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,476 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,476 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,483 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,484 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,485 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,486 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,487 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,488 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,496 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,497 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,497 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:53,569 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 [2018-11-28 23:13:53,570 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 [2018-11-28 23:13:53,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-28 23:13:53,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 39 transitions. [2018-11-28 23:13:53,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 14 letters. [2018-11-28 23:13:53,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:53,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 19 letters. Loop has 14 letters. [2018-11-28 23:13:53,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:53,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 39 transitions. Stem has 5 letters. Loop has 28 letters. [2018-11-28 23:13:53,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:53,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1787 states and 2714 transitions. [2018-11-28 23:13:53,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 33 [2018-11-28 23:13:53,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1787 states to 471 states and 636 transitions. [2018-11-28 23:13:53,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-28 23:13:53,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2018-11-28 23:13:53,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 636 transitions. [2018-11-28 23:13:53,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:53,615 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 636 transitions. [2018-11-28 23:13:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 636 transitions. [2018-11-28 23:13:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 260. [2018-11-28 23:13:53,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-11-28 23:13:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 376 transitions. [2018-11-28 23:13:53,647 INFO L728 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 23:13:53,647 INFO L608 BuchiCegarLoop]: Abstraction has 260 states and 376 transitions. [2018-11-28 23:13:53,647 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-28 23:13:53,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 260 states and 376 transitions. [2018-11-28 23:13:53,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 21 [2018-11-28 23:13:53,656 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:53,656 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:53,659 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:53,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 5, 4] [2018-11-28 23:13:53,659 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 [2018-11-28 23:13:53,659 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 [2018-11-28 23:13:53,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:53,660 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 7 times [2018-11-28 23:13:53,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:53,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:53,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:53,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:53,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:53,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1476420572, now seen corresponding path program 7 times [2018-11-28 23:13:53,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:53,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:53,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:53,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:53,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:53,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:53,702 INFO L82 PathProgramCache]: Analyzing trace with hash 939927885, now seen corresponding path program 10 times [2018-11-28 23:13:53,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:53,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:53,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:13:53,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:54,724 WARN L180 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2018-11-28 23:13:54,760 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:54,760 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:54,760 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:54,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:54,761 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:54,761 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:54,761 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:54,761 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:54,761 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2018-11-28 23:13:54,761 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:54,762 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:54,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:54,828 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:54,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:54,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:54,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:54,857 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 [2018-11-28 23:13:54,863 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:54,863 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:54,889 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:54,889 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:54,911 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:54,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:54,913 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:54,913 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:54,913 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:54,913 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:54,913 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:54,913 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:54,913 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:54,913 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration12_Loop [2018-11-28 23:13:54,913 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:54,913 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:54,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:54,989 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:54,989 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:54,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:54,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:54,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:54,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:54,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:54,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:54,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:54,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:54,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:54,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:54,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:54,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:54,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:54,996 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:54,996 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:54,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:54,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:54,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:54,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:54,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:54,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:54,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:54,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:54,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:55,001 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:55,002 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:55,002 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:55,003 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:55,003 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:55,003 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:55,003 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:55,003 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:55,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:55,166 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:55,167 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-11-28 23:13:55,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-11-28 23:13:55,186 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. [2018-11-28 23:13:55,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:55,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:13:55,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:55,190 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:55,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:55,801 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 [2018-11-28 23:13:55,801 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-11-28 23:13:55,837 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. [2018-11-28 23:13:55,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:55,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:55,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:13:55,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:55,843 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:55,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:55,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:56,141 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 [2018-11-28 23:13:56,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-11-28 23:13:56,181 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. [2018-11-28 23:13:56,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:56,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:13:56,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:56,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:56,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:56,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:56,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:56,549 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 [2018-11-28 23:13:56,549 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-11-28 23:13:56,590 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. [2018-11-28 23:13:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:13:56,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:13:56,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:56,593 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:56,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:56,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:56,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:56,777 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:56,778 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 [2018-11-28 23:13:56,778 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 260 states and 376 transitions. cyclomatic complexity: 137 Second operand 11 states. [2018-11-28 23:13:57,060 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,061 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,061 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,061 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,062 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,062 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,066 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,066 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,067 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,067 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,067 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,067 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,073 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,073 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,074 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,074 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,074 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,074 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,078 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,079 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,079 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,080 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,080 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,080 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,081 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,081 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,081 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,081 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,256 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,257 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,261 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,262 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,262 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,264 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,265 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,267 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,267 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,268 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,273 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,273 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,273 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,273 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,274 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,274 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,275 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,275 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,279 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,279 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,279 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,279 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,280 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,283 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,283 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,284 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,284 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,284 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,284 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,285 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,285 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,286 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,286 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,286 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,286 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,286 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,287 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,290 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,290 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,290 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,290 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,381 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,381 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,395 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,398 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,512 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,513 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,515 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,516 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,516 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,516 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,516 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,517 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,517 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,517 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,517 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,517 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,519 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,521 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,522 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,523 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,524 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,525 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,526 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:57,579 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 [2018-11-28 23:13:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:57,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-28 23:13:57,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 49 transitions. [2018-11-28 23:13:57,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 18 letters. [2018-11-28 23:13:57,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:57,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 23 letters. Loop has 18 letters. [2018-11-28 23:13:57,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:57,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 49 transitions. Stem has 5 letters. Loop has 36 letters. [2018-11-28 23:13:57,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:57,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5484 states and 8953 transitions. [2018-11-28 23:13:57,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2018-11-28 23:13:57,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5484 states to 1391 states and 1971 transitions. [2018-11-28 23:13:57,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-28 23:13:57,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-28 23:13:57,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1391 states and 1971 transitions. [2018-11-28 23:13:57,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:13:57,647 INFO L705 BuchiCegarLoop]: Abstraction has 1391 states and 1971 transitions. [2018-11-28 23:13:57,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states and 1971 transitions. [2018-11-28 23:13:57,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 660. [2018-11-28 23:13:57,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-28 23:13:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1049 transitions. [2018-11-28 23:13:57,676 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2018-11-28 23:13:57,676 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 1049 transitions. [2018-11-28 23:13:57,676 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-28 23:13:57,676 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 1049 transitions. [2018-11-28 23:13:57,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2018-11-28 23:13:57,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:13:57,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:13:57,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:13:57,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [11, 6, 5] [2018-11-28 23:13:57,687 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 [2018-11-28 23:13:57,689 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 [2018-11-28 23:13:57,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:57,689 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 8 times [2018-11-28 23:13:57,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:57,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:57,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:57,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:57,703 INFO L82 PathProgramCache]: Analyzing trace with hash 684828652, now seen corresponding path program 8 times [2018-11-28 23:13:57,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:57,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:57,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:57,721 INFO L82 PathProgramCache]: Analyzing trace with hash 185301141, now seen corresponding path program 11 times [2018-11-28 23:13:57,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:13:57,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:13:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:13:57,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:13:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:13:58,148 WARN L180 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-11-28 23:13:58,157 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:58,157 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:58,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:58,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:58,158 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:13:58,158 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,158 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:58,158 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:58,158 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2018-11-28 23:13:58,159 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:58,159 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:58,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,253 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:58,253 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 [2018-11-28 23:13:58,259 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,259 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:58,278 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:58,278 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) [2018-11-28 23:13:58,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,289 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,311 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-28 23:13:58,312 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 [2018-11-28 23:13:58,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:13:58,318 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 [2018-11-28 23:13:58,340 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:13:58,340 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:13:58,362 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:13:58,364 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:13:58,364 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:13:58,364 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:13:58,364 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:13:58,364 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:13:58,364 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:13:58,365 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:13:58,365 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:13:58,365 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration13_Loop [2018-11-28 23:13:58,365 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:13:58,365 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:13:58,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:13:58,441 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:13:58,441 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:13:58,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:58,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:58,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:58,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:58,443 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:58,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:58,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:58,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:58,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:58,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:58,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:58,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:58,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:58,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:13:58,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:13:58,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:13:58,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:13:58,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:13:58,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:13:58,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:13:58,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:13:58,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:13:58,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:13:58,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:13:58,452 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:13:58,453 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:13:58,453 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:13:58,454 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:13:58,454 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:13:58,454 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:13:58,454 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = 1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2018-11-28 23:13:58,454 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:13:58,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:58,652 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 [2018-11-28 23:13:58,652 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-11-28 23:13:58,658 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. [2018-11-28 23:13:58,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:58,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:13:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:58,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-28 23:13:58,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:58,660 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:58,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:58,808 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 [2018-11-28 23:13:58,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-11-28 23:13:58,818 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. [2018-11-28 23:13:58,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:13:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:13:58,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-28 23:13:58,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:58,821 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:58,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:58,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:58,997 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 [2018-11-28 23:13:58,997 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-11-28 23:13:59,007 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. [2018-11-28 23:13:59,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:13:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2018-11-28 23:13:59,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-28 23:13:59,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:59,009 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:59,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:59,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:59,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:59,179 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 [2018-11-28 23:13:59,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-11-28 23:13:59,244 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. [2018-11-28 23:13:59,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-28 23:13:59,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:13:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2018-11-28 23:13:59,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-28 23:13:59,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:13:59,247 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:13:59,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:13:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:59,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:13:59,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:13:59,424 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 50 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:13:59,425 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 [2018-11-28 23:13:59,425 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 660 states and 1049 transitions. cyclomatic complexity: 434 Second operand 13 states. [2018-11-28 23:13:59,684 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,684 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,687 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,687 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,687 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,688 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,692 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,692 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,693 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,693 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,693 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,694 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,694 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,698 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,698 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,699 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,704 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,705 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,705 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,705 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,705 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,706 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,706 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,706 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,706 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,707 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,710 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,710 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,710 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,711 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,712 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,712 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,712 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,712 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,713 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,716 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,716 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,716 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,717 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,717 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,717 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,718 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,718 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,718 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,718 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,718 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,791 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,792 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,793 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,794 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,795 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,795 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,795 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,795 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,796 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,797 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,797 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,798 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,798 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,798 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,799 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,799 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,799 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,799 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,800 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,801 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,802 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,803 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,804 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,805 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,806 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,806 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,807 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,807 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,807 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,807 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,808 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,808 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,808 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,808 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,809 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,810 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,811 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,812 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,812 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,813 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,813 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,813 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,814 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,815 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,816 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,816 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,817 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,817 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,818 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,819 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,934 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,935 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,936 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,937 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,942 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,943 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,943 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,944 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,945 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,945 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,945 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,945 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,946 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,946 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,947 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,948 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,949 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,950 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,950 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,951 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,952 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,952 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,952 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,953 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,954 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,955 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,956 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,957 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,958 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,959 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,960 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,961 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,961 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,962 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,962 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,962 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,962 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,963 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,963 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,964 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,964 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,964 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,964 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,965 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,966 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,967 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,967 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,967 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,967 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,968 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,969 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,969 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,969 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,969 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,969 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,970 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,971 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,972 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,973 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,973 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,973 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,973 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,973 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,974 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,975 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,975 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,975 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,975 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,975 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,976 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,976 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,977 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,977 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,977 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,977 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,977 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,978 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,979 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,979 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,979 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:13:59,979 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,161 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,161 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,161 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,161 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,162 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,162 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,164 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,164 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,164 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,164 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,165 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,166 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,168 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,169 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,170 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,172 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,172 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,172 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,172 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,173 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,174 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,175 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,176 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,176 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,176 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,176 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,176 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,177 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,178 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,179 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,180 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,181 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,182 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,183 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,184 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,185 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,185 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,185 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,185 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,185 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,187 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,187 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,187 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,187 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,188 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,189 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,190 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,190 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,190 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,190 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,190 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,192 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,193 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,193 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,193 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,193 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,194 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,194 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,194 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,194 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,194 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,195 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,196 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,197 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,197 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,197 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,198 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,199 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,199 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,368 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,368 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,368 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,369 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,370 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,370 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,370 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,372 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,372 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,373 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,374 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,374 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,374 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,375 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,375 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,376 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,376 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,376 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,376 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,378 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,378 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,379 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,380 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,381 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,381 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,382 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,383 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,384 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,385 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,386 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,387 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,388 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,389 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,390 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,391 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,392 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,393 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,394 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,395 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,395 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,396 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,397 WARN L278 uchiComplementFKVNwa]: big8 [2018-11-28 23:14:00,458 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 [2018-11-28 23:14:00,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:00,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:14:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2018-11-28 23:14:00,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 22 letters. [2018-11-28 23:14:00,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:00,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 27 letters. Loop has 22 letters. [2018-11-28 23:14:00,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:00,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 59 transitions. Stem has 5 letters. Loop has 44 letters. [2018-11-28 23:14:00,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:00,463 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14845 states and 25888 transitions. [2018-11-28 23:14:00,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-11-28 23:14:00,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14845 states to 3699 states and 5622 transitions. [2018-11-28 23:14:00,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-28 23:14:00,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:14:00,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3699 states and 5622 transitions. [2018-11-28 23:14:00,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:14:00,603 INFO L705 BuchiCegarLoop]: Abstraction has 3699 states and 5622 transitions. [2018-11-28 23:14:00,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states and 5622 transitions. [2018-11-28 23:14:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 1604. [2018-11-28 23:14:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2018-11-28 23:14:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2868 transitions. [2018-11-28 23:14:00,659 INFO L728 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2018-11-28 23:14:00,659 INFO L608 BuchiCegarLoop]: Abstraction has 1604 states and 2868 transitions. [2018-11-28 23:14:00,659 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-28 23:14:00,659 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1604 states and 2868 transitions. [2018-11-28 23:14:00,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-28 23:14:00,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:14:00,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:14:00,665 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2018-11-28 23:14:00,666 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 7, 6] [2018-11-28 23:14:00,666 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 [2018-11-28 23:14:00,666 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 [2018-11-28 23:14:00,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:00,666 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 9 times [2018-11-28 23:14:00,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,667 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:00,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:00,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1767338060, now seen corresponding path program 9 times [2018-11-28 23:14:00,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:00,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:00,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:00,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:00,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:00,685 INFO L82 PathProgramCache]: Analyzing trace with hash 818406365, now seen corresponding path program 12 times [2018-11-28 23:14:00,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:14:00,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:14:00,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:14:00,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:14:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:14:01,169 WARN L180 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 91 [2018-11-28 23:14:01,187 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:01,187 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:01,187 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:01,187 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:01,187 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-28 23:14:01,187 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:01,188 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:01,188 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:01,188 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2018-11-28 23:14:01,188 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:01,188 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:01,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:01,297 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 [2018-11-28 23:14:01,302 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-28 23:14:01,303 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 [2018-11-28 23:14:01,325 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-28 23:14:01,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-28 23:14:01,348 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-28 23:14:01,350 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:14:01,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:14:01,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:14:01,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:14:01,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:14:01,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:14:01,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:14:01,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:14:01,351 INFO L131 ssoRankerPreferences]: Filename of dumped script: McCarthy91_Iteration_true-no-overflow_true-termination_true-valid-memsafety.c_Iteration14_Loop [2018-11-28 23:14:01,351 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:14:01,351 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:14:01,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:14:01,439 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:14:01,439 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:14:01,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:01,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:01,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:01,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:01,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:01,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:14:01,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:14:01,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:14:01,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:14:01,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:14:01,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:14:01,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:14:01,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:14:01,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:14:01,445 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:14:01,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:14:01,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:14:01,447 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:14:01,447 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:14:01,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:14:01,448 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-28 23:14:01,448 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:14:01,448 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~c~0) = 1*ULTIMATE.start_main_~c~0 Supporting invariants [] [2018-11-28 23:14:01,448 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-28 23:14:01,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,566 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,628 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 23:14:01,629 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-28 23:14:01,629 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-11-28 23:14:01,643 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. [2018-11-28 23:14:01,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:01,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:01,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:14:01,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-28 23:14:01,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:01,646 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:01,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,738 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 23:14:01,738 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 [2018-11-28 23:14:01,738 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-11-28 23:14:01,752 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. [2018-11-28 23:14:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:01,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4 transitions. [2018-11-28 23:14:01,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 4 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-28 23:14:01,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:01,754 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:01,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:01,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:01,799 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:01,842 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 23:14:01,843 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 [2018-11-28 23:14:01,843 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-11-28 23:14:01,877 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. [2018-11-28 23:14:01,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2018-11-28 23:14:01,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-28 23:14:01,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:01,888 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-28 23:14:02,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:14:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:02,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:14:02,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:14:02,183 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 81 proven. 35 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-28 23:14:02,185 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 [2018-11-28 23:14:02,185 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1604 states and 2868 transitions. cyclomatic complexity: 1357 Second operand 8 states. [2018-11-28 23:14:02,238 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. [2018-11-28 23:14:02,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-28 23:14:02,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-28 23:14:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 13 transitions. [2018-11-28 23:14:02,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 26 letters. [2018-11-28 23:14:02,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:02,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 31 letters. Loop has 26 letters. [2018-11-28 23:14:02,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:02,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 13 transitions. Stem has 5 letters. Loop has 52 letters. [2018-11-28 23:14:02,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:14:02,245 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3111 states and 5286 transitions. [2018-11-28 23:14:02,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:02,257 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3111 states to 0 states and 0 transitions. [2018-11-28 23:14:02,257 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:14:02,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:14:02,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:14:02,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:14:02,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:02,257 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:02,258 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:14:02,258 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-28 23:14:02,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:14:02,258 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:14:02,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:14:02,266 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:14:02 BoogieIcfgContainer [2018-11-28 23:14:02,266 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:14:02,266 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:14:02,266 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:14:02,267 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:14:02,267 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:13:40" (3/4) ... [2018-11-28 23:14:02,271 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:14:02,271 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:14:02,272 INFO L168 Benchmark]: Toolchain (without parser) took 22434.39 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 952.7 MB in the beginning and 998.2 MB in the end (delta: -45.5 MB). Peak memory consumption was 332.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:02,273 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. [2018-11-28 23:14:02,273 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:02,274 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:02,274 INFO L168 Benchmark]: Boogie Preprocessor took 31.50 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:02,275 INFO L168 Benchmark]: RCFGBuilder took 472.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:02,275 INFO L168 Benchmark]: BuchiAutomizer took 21569.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 115.9 MB). Peak memory consumption was 359.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:14:02,276 INFO L168 Benchmark]: Witness Printer took 4.71 ms. Allocated memory is still 1.4 GB. Free memory is still 998.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:14:02,280 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 302.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 47.63 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.50 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 472.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21569.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.1 GB in the beginning and 998.2 MB in the end (delta: 115.9 MB). Peak memory consumption was 359.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.71 ms. Allocated memory is still 1.4 GB. Free memory is still 998.2 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 21.5s and 15 iterations. TraceHistogramMax:13. Analysis of lassos took 9.5s. Construction of modules took 1.8s. Büchi inclusion checks took 9.3s. 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.2s 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.8s 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...