./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-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-0ed9222-m [2019-01-14 02:47:01,994 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:47:01,996 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:47:02,007 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:47:02,008 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:47:02,009 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:47:02,010 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:47:02,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:47:02,014 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:47:02,014 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:47:02,016 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:47:02,016 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:47:02,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:47:02,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:47:02,019 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:47:02,020 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:47:02,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:47:02,023 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:47:02,025 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:47:02,027 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:47:02,028 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:47:02,029 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:47:02,032 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:47:02,032 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:47:02,032 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:47:02,033 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:47:02,034 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:47:02,035 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:47:02,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:47:02,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:47:02,037 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:47:02,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:47:02,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:47:02,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:47:02,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:47:02,041 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:47:02,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:47:02,059 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:47:02,060 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:47:02,061 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:47:02,062 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:47:02,062 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:47:02,062 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:47:02,063 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:47:02,063 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:47:02,063 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:47:02,063 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:47:02,063 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:47:02,063 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:47:02,065 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:47:02,065 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:47:02,065 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:47:02,065 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:47:02,066 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:47:02,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:47:02,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:47:02,068 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:47:02,068 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:47:02,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:47:02,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:47:02,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:47:02,068 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:47:02,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:47:02,070 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:47:02,070 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:47:02,071 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:47:02,071 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-14 02:47:02,117 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:47:02,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:47:02,132 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:47:02,134 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:47:02,134 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:47:02,135 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncpy_malloc_true-termination.c.i [2019-01-14 02:47:02,184 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7a21f36/d33cb854e8bc48579cdf547a0aed6f42/FLAG9132cabdf [2019-01-14 02:47:02,687 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:47:02,688 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncpy_malloc_true-termination.c.i [2019-01-14 02:47:02,702 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7a21f36/d33cb854e8bc48579cdf547a0aed6f42/FLAG9132cabdf [2019-01-14 02:47:02,968 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d7a21f36/d33cb854e8bc48579cdf547a0aed6f42 [2019-01-14 02:47:02,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:47:02,972 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:47:02,973 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:02,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:47:02,977 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:47:02,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:02" (1/1) ... [2019-01-14 02:47:02,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15148d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:02, skipping insertion in model container [2019-01-14 02:47:02,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:02" (1/1) ... [2019-01-14 02:47:02,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:47:03,031 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:47:03,352 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:03,368 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:47:03,448 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:03,594 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:47:03,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03 WrapperNode [2019-01-14 02:47:03,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:03,595 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:03,595 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:47:03,595 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:47:03,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:03,644 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:47:03,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:47:03,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:47:03,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,656 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,656 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,678 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:47:03,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:47:03,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:47:03,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:47:03,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:03,733 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:47:03,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:47:03,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 02:47:03,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:47:03,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:47:03,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:47:04,101 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:47:04,102 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:47:04,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:04 BoogieIcfgContainer [2019-01-14 02:47:04,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:47:04,103 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:47:04,104 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:47:04,106 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:47:04,107 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:04,107 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:47:02" (1/3) ... [2019-01-14 02:47:04,108 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5919fa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:04, skipping insertion in model container [2019-01-14 02:47:04,108 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:04,108 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03" (2/3) ... [2019-01-14 02:47:04,109 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5919fa44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:04, skipping insertion in model container [2019-01-14 02:47:04,109 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:04,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:04" (3/3) ... [2019-01-14 02:47:04,111 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc_true-termination.c.i [2019-01-14 02:47:04,162 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:47:04,162 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:47:04,162 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:47:04,162 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:47:04,163 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:47:04,163 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:47:04,163 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:47:04,163 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:47:04,163 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:47:04,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:47:04,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:47:04,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:04,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:04,200 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:04,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:04,200 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:47:04,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:47:04,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:47:04,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:04,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:04,203 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:04,203 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:04,209 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-14 02:47:04,210 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~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208; 14#L370-2true [2019-01-14 02:47:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:47:04,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:04,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:04,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-14 02:47:04,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:04,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:04,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:04,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-14 02:47:04,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:04,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:04,756 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 02:47:04,929 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:47:05,788 WARN L181 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-14 02:47:05,963 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-14 02:47:05,976 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:05,978 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:05,978 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:05,978 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:05,978 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:05,979 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:05,979 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:05,979 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:05,979 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:47:05,979 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:05,980 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:06,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,589 WARN L181 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-14 02:47:06,875 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-14 02:47:06,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:06,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:07,157 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:47:07,503 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:47:08,049 WARN L181 SmtUtils]: Spent 479.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:47:08,137 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:08,142 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:08,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,154 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,154 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,162 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:08,162 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:08,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,169 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:08,169 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:08,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,177 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,179 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,181 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,181 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,181 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,189 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,195 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,198 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,198 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,199 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,200 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,200 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,201 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,201 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:08,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,203 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:08,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:08,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:08,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:08,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:08,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:08,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:08,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:08,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:08,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:08,351 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:08,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 02:47:08,397 INFO L444 ModelExtractionUtils]: 55 out of 58 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-14 02:47:08,399 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:08,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:08,405 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:08,406 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-14 02:47:08,585 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:47:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:08,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:08,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:08,741 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:47:08,742 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-14 02:47:08,795 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-14 02:47:08,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 02:47:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:47:08,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:47:08,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:08,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:47:08,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:08,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:47:08,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:08,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 02:47:08,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:08,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-14 02:47:08,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:47:08,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:08,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:47:08,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:08,816 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:47:08,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:47:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:47:08,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:47:08,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:47:08,837 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:47:08,837 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:47:08,837 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:47:08,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:47:08,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:08,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:08,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:08,839 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:08,839 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:08,839 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~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;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-14 02:47:08,839 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-14 02:47:08,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:08,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-14 02:47:08,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:08,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:08,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:08,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:08,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:08,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-14 02:47:08,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:08,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:08,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-14 02:47:08,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:08,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:08,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:08,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:08,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,676 WARN L181 SmtUtils]: Spent 610.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 127 [2019-01-14 02:47:09,857 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-01-14 02:47:09,860 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:09,860 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:09,860 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:09,860 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:09,861 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:09,861 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:09,861 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:09,861 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:09,861 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:47:09,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:09,862 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:09,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:09,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:10,360 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 85 [2019-01-14 02:47:10,481 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-01-14 02:47:10,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:10,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:10,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:10,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:10,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-14 02:47:10,914 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-14 02:47:11,571 WARN L181 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:47:11,842 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-01-14 02:47:11,863 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:11,863 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:11,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,878 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:11,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:11,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,909 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:11,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:11,911 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,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-14 02:47:11,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,925 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,930 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,930 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,932 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:11,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,933 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:11,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:11,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,937 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,938 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:47:11,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,938 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,951 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:47:11,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:11,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:11,993 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:11,995 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:11,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:11,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:11,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:11,997 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:11,997 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,008 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:12,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:12,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:12,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:12,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:12,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:12,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:12,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:12,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,069 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:12,069 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:12,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:12,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:12,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:12,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:12,075 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:47:12,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:12,088 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:47:12,088 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:47:12,228 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:12,436 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2019-01-14 02:47:12,438 INFO L444 ModelExtractionUtils]: 83 out of 91 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:47:12,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:12,440 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:47:12,440 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:12,440 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-14 02:47:12,708 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:47:12,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:12,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:12,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:12,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:47:12,809 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-14 02:47:12,809 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:47:12,937 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-14 02:47:12,939 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-14 02:47:12,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:12,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:47:12,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:47:12,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:12,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:47:12,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:12,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:47:12,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:12,941 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-14 02:47:12,942 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:12,943 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-14 02:47:12,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:47:12,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:47:12,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:47:12,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:12,944 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:12,944 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:12,944 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:12,944 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:12,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:47:12,944 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:12,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:47:12,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:47:12 BoogieIcfgContainer [2019-01-14 02:47:12,950 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:47:12,951 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:47:12,951 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:47:12,951 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:47:12,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:04" (3/4) ... [2019-01-14 02:47:12,956 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:47:12,957 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:47:12,957 INFO L168 Benchmark]: Toolchain (without parser) took 9985.64 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 300.4 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -55.2 MB). Peak memory consumption was 245.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,959 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-14 02:47:12,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,963 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:12,963 INFO L168 Benchmark]: RCFGBuilder took 420.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,964 INFO L168 Benchmark]: BuchiAutomizer took 8846.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 244.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,965 INFO L168 Benchmark]: Witness Printer took 6.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:12,970 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 621.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 420.82 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8846.80 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 164.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 80.7 MB). Peak memory consumption was 244.8 MB. Max. memory is 11.5 GB. * Witness Printer took 6.04 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. 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 8.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.2s. 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: 366ms 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...