./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncpy_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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-15/cstrncpy_malloc_true-termination.c.i -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 7c56c09a74d2fc3893706afbe8a4ee36044dd617 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:04:18,986 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:04:18,987 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:04:19,001 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:04:19,001 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:04:19,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:04:19,005 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:04:19,008 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:04:19,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:04:19,012 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:04:19,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:04:19,013 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:04:19,021 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:04:19,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:04:19,025 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:04:19,025 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:04:19,026 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:04:19,029 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:04:19,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:04:19,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:04:19,037 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:04:19,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:04:19,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:04:19,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:04:19,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:04:19,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:04:19,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:04:19,047 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:04:19,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:04:19,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:04:19,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:04:19,053 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:04:19,054 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:04:19,054 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:04:19,055 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:04:19,056 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:04:19,056 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 22:04:19,086 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:04:19,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:04:19,089 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:04:19,090 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:04:19,090 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:04:19,090 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:04:19,091 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:04:19,091 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:04:19,091 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:04:19,091 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:04:19,091 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:04:19,091 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:04:19,092 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:04:19,093 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:04:19,093 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:04:19,093 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:04:19,093 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:04:19,093 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:04:19,093 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:04:19,094 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:04:19,094 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:04:19,094 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:04:19,094 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:04:19,095 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:04:19,095 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 -> 7c56c09a74d2fc3893706afbe8a4ee36044dd617 [2019-01-01 22:04:19,141 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:04:19,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:04:19,162 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:04:19,164 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:04:19,164 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:04:19,165 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncpy_malloc_true-termination.c.i [2019-01-01 22:04:19,220 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed232cd1/ebe46797e6b04816bbd548953f615983/FLAG84262c5e2 [2019-01-01 22:04:19,686 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:04:19,687 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncpy_malloc_true-termination.c.i [2019-01-01 22:04:19,697 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed232cd1/ebe46797e6b04816bbd548953f615983/FLAG84262c5e2 [2019-01-01 22:04:19,981 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ed232cd1/ebe46797e6b04816bbd548953f615983 [2019-01-01 22:04:19,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:04:19,986 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:04:19,987 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:19,987 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:04:19,991 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:04:19,991 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:19" (1/1) ... [2019-01-01 22:04:19,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aa3694e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:19, skipping insertion in model container [2019-01-01 22:04:19,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:04:19" (1/1) ... [2019-01-01 22:04:20,002 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:04:20,043 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:04:20,426 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:20,440 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:04:20,594 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:04:20,690 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:04:20,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20 WrapperNode [2019-01-01 22:04:20,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:04:20,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:20,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:04:20,692 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:04:20,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,744 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:04:20,745 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:04:20,745 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:04:20,745 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:04:20,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,771 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... [2019-01-01 22:04:20,773 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:04:20,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:04:20,774 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:04:20,774 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:04:20,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:04:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 22:04:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 22:04:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 22:04:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 22:04:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:04:20,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:04:21,305 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:04:21,305 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 22:04:21,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:21 BoogieIcfgContainer [2019-01-01 22:04:21,306 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:04:21,307 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:04:21,307 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:04:21,310 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:04:21,311 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:21,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:04:19" (1/3) ... [2019-01-01 22:04:21,312 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fdcf9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:21, skipping insertion in model container [2019-01-01 22:04:21,312 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:21,312 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:04:20" (2/3) ... [2019-01-01 22:04:21,313 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fdcf9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:04:21, skipping insertion in model container [2019-01-01 22:04:21,313 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:04:21,313 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:21" (3/3) ... [2019-01-01 22:04:21,315 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc_true-termination.c.i [2019-01-01 22:04:21,379 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:04:21,380 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:04:21,380 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:04:21,380 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:04:21,381 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:04:21,381 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:04:21,381 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:04:21,381 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:04:21,381 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:04:21,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 22:04:21,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:04:21,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:21,422 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:21,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:21,431 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:04:21,431 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:04:21,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 22:04:21,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 22:04:21,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:21,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:21,433 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 22:04:21,434 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:04:21,442 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnHeap(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnHeap(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 14#L370-2true [2019-01-01 22:04:21,442 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2019-01-01 22:04:21,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:21,450 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 22:04:21,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:21,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:21,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-01 22:04:21,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:21,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:21,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-01 22:04:21,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:21,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:21,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:21,971 WARN L181 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 22:04:23,123 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-01 22:04:23,313 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 22:04:23,330 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:04:23,331 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:04:23,331 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:04:23,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:04:23,331 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:04:23,332 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:04:23,332 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:04:23,332 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:04:23,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration1_Lasso [2019-01-01 22:04:23,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:04:23,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:04:23,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:24,005 WARN L181 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-01 22:04:24,353 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-01 22:04:24,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:24,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:24,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:24,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:24,640 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:04:25,047 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:04:25,159 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-01 22:04:25,620 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 22:04:25,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:04:25,717 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:04:25,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:25,745 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:25,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,754 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:25,754 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:25,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,778 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,791 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,793 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,808 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,811 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:25,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,811 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,812 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:25,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:25,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:25,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:25,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:25,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:25,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:25,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:25,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:25,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:26,011 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:04:26,048 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:04:26,048 INFO L444 ModelExtractionUtils]: 55 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 22:04:26,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:04:26,053 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 22:04:26,054 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:04:26,054 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-01 22:04:26,266 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 22:04:26,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:26,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:26,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:26,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:26,401 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:04:26,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-01 22:04:26,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-01-01 22:04:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:04:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:04:26,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 22:04:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 22:04:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:04:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 22:04:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:26,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 22:04:26,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:04:26,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-01 22:04:26,490 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 22:04:26,490 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 22:04:26,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 22:04:26,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:26,492 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 22:04:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 22:04:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 22:04:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 22:04:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 22:04:26,517 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 22:04:26,517 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 22:04:26,517 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:04:26,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 22:04:26,519 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 22:04:26,519 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:04:26,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:04:26,520 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:04:26,520 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 22:04:26,521 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 145#L385 assume !(main_~length~0 < 1); 150#L385-2 assume !(main_~n~0 < 1); 148#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnHeap(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.allocOnHeap(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 149#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, 1 + cstrncpy_#t~post206.offset;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 141#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L375-3 [2019-01-01 22:04:26,521 INFO L796 eck$LassoCheckResult]: Loop: 143#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 146#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, 1 + cstrncpy_#t~post210.offset;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 143#L375-3 [2019-01-01 22:04:26,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:26,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-01 22:04:26,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:26,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:26,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:26,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-01 22:04:26,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:26,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:26,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:26,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-01 22:04:26,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:04:26,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:04:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:04:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:04:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:04:26,796 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 22:04:27,560 WARN L181 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-01-01 22:04:27,746 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-01 22:04:27,750 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:04:27,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:04:27,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:04:27,750 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:04:27,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:04:27,752 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:04:27,752 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:04:27,752 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:04:27,752 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration2_Lasso [2019-01-01 22:04:27,753 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:04:27,753 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:04:27,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:27,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,392 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-01 22:04:28,512 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-01-01 22:04:28,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:04:28,993 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 22:04:29,636 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 22:04:29,899 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-01 22:04:29,921 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:04:29,922 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:04:29,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,925 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,925 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,931 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,935 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,940 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,941 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,943 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,943 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:29,943 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:29,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,958 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:29,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:29,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,974 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,974 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,974 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,985 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:29,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:29,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:29,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:29,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:29,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:29,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:29,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:29,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:29,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,000 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-01 22:04:30,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,006 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-01 22:04:30,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,037 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,044 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:04:30,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:04:30,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:04:30,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,067 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,068 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,068 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:04:30,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,081 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 22:04:30,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 22:04:30,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:04:30,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:04:30,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:04:30,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:04:30,085 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 22:04:30,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:04:30,098 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 22:04:30,098 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 22:04:30,207 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:04:30,319 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-01-01 22:04:30,319 INFO L444 ModelExtractionUtils]: 83 out of 91 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 22:04:30,319 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:04:30,322 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 22:04:30,322 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:04:30,322 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 Supporting invariants [] [2019-01-01 22:04:30,539 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 22:04:30,545 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 22:04:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:04:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:30,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:04:30,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:04:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:04:30,602 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-01 22:04:30,603 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 22:04:30,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-01-01 22:04:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:04:30,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:04:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 22:04:30,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 22:04:30,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:30,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 22:04:30,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:30,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 22:04:30,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:04:30,745 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-01 22:04:30,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:30,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-01 22:04:30,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:04:30,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:04:30,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:04:30,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:04:30,746 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:30,746 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:30,747 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:04:30,748 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:04:30,748 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:04:30,748 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:04:30,748 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:04:30,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:04:30 BoogieIcfgContainer [2019-01-01 22:04:30,754 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:04:30,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:04:30,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:04:30,755 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:04:30,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:04:21" (3/4) ... [2019-01-01 22:04:30,761 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:04:30,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:04:30,762 INFO L168 Benchmark]: Toolchain (without parser) took 10777.00 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 286.3 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -54.5 MB). Peak memory consumption was 231.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:30,763 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:30,765 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:30,766 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:30,766 INFO L168 Benchmark]: Boogie Preprocessor took 28.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:30,768 INFO L168 Benchmark]: RCFGBuilder took 532.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:30,768 INFO L168 Benchmark]: BuchiAutomizer took 9447.51 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:04:30,770 INFO L168 Benchmark]: Witness Printer took 6.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:04:30,775 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.15 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 704.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 102.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -127.5 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.34 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 532.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9447.51 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.5 MB). Peak memory consumption was 232.5 MB. Max. memory is 11.5 GB. * Witness Printer took 6.91 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[malloc(n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital231 mio100 ax100 hnf99 lsp97 ukn87 mio100 lsp50 div100 bol100 ite100 ukn100 eq201 hnf88 smp100 dnf168 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 238ms VariablesStem: 17 VariablesLoop: 11 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...