./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-15/cstrncpy_mixed_alloca_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_mixed_alloca_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 493d4075183da22c41b393b09f987b5f1b55266e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:02,864 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:47:02,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:47:02,878 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:47:02,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:47:02,880 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:47:02,882 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:47:02,884 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:47:02,886 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:47:02,887 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:47:02,888 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:47:02,888 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:47:02,889 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:47:02,891 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:47:02,892 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:47:02,893 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:47:02,894 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:47:02,896 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:47:02,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:47:02,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:47:02,902 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:47:02,904 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:47:02,907 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:47:02,907 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:47:02,907 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:47:02,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:47:02,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:47:02,911 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:47:02,912 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:47:02,914 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:47:02,914 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:47:02,915 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:47:02,915 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:47:02,915 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:47:02,917 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:47:02,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:47:02,918 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,947 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:47:02,947 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:47:02,950 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:47:02,950 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:47:02,950 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:47:02,950 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:47:02,951 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:47:02,952 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:47:02,952 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:47:02,952 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:47:02,952 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:47:02,952 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:47:02,952 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:47:02,953 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:47:02,954 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:47:02,954 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:47:02,954 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:47:02,954 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:47:02,954 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:47:02,955 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:47:02,955 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:47:02,955 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:47:02,955 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:47:02,956 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:47:02,956 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 -> 493d4075183da22c41b393b09f987b5f1b55266e [2019-01-14 02:47:03,003 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:47:03,019 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:47:03,025 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:47:03,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:47:03,027 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:47:03,028 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2019-01-14 02:47:03,093 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a99e28a/964a7361a7944bd5ba45cc5115609b76/FLAG74be98b18 [2019-01-14 02:47:03,603 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:47:03,604 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2019-01-14 02:47:03,616 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a99e28a/964a7361a7944bd5ba45cc5115609b76/FLAG74be98b18 [2019-01-14 02:47:03,912 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3a99e28a/964a7361a7944bd5ba45cc5115609b76 [2019-01-14 02:47:03,915 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:47:03,916 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:47:03,917 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:03,917 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:47:03,921 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:47:03,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,927 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7730cce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:03, skipping insertion in model container [2019-01-14 02:47:03,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:47:03" (1/1) ... [2019-01-14 02:47:03,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:47:03,979 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:47:04,360 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:04,378 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:47:04,453 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:47:04,606 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:47:04,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:04 WrapperNode [2019-01-14 02:47:04,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:47:04,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:04,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:47:04,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:47:04,617 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:04" (1/1) ... [2019-01-14 02:47:04,632 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:04" (1/1) ... [2019-01-14 02:47:04,654 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:47:04,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:47:04,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:47:04,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:47:04,664 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:04" (1/1) ... [2019-01-14 02:47:04,664 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:04" (1/1) ... [2019-01-14 02:47:04,667 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:04" (1/1) ... [2019-01-14 02:47:04,667 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:04" (1/1) ... [2019-01-14 02:47:04,674 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:04" (1/1) ... [2019-01-14 02:47:04,679 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:04" (1/1) ... [2019-01-14 02:47:04,681 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:04" (1/1) ... [2019-01-14 02:47:04,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:47:04,684 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:47:04,684 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:47:04,684 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:47:04,685 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:04" (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:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:47:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:47:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:47:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:47:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:47:04,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:47:05,128 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:47:05,129 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:47:05,130 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:05 BoogieIcfgContainer [2019-01-14 02:47:05,130 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:47:05,131 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:47:05,131 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:47:05,134 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:47:05,135 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:05,135 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:47:03" (1/3) ... [2019-01-14 02:47:05,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1806c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:05, skipping insertion in model container [2019-01-14 02:47:05,136 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:05,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:47:04" (2/3) ... [2019-01-14 02:47:05,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1806c15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:47:05, skipping insertion in model container [2019-01-14 02:47:05,137 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:47:05,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:47:05" (3/3) ... [2019-01-14 02:47:05,139 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca_true-termination.c.i [2019-01-14 02:47:05,194 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:47:05,195 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:47:05,195 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:47:05,195 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:47:05,195 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:47:05,195 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:47:05,195 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:47:05,196 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:47:05,196 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:47:05,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:47:05,228 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:47:05,229 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:05,229 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:05,235 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:05,235 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:05,235 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:47:05,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:47:05,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:47:05,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:05,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:05,239 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:47:05,239 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:05,247 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.allocOnStack(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.allocOnStack(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);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 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:05,248 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, cstrncpy_#t~post206.offset - 1;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~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset; 14#L370-2true [2019-01-14 02:47:05,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:47:05,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:05,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:05,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-14 02:47:05,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:05,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:05,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:05,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-14 02:47:05,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:05,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:05,755 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-01-14 02:47:06,011 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 02:47:06,844 WARN L181 SmtUtils]: Spent 826.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2019-01-14 02:47:06,984 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-01-14 02:47:06,998 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:06,999 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:07,000 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:07,000 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:07,000 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:07,000 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:07,000 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:07,001 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:07,001 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:47:07,001 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:07,001 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:07,031 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,066 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,075 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,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:07,604 WARN L181 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 78 [2019-01-14 02:47:07,802 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-01-14 02:47:07,803 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,806 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,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:07,811 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,814 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,818 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,820 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,823 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,827 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,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:07,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:07,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:07,863 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,865 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,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:07,870 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,872 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,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,054 WARN L181 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:47:09,166 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:09,171 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:09,174 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:09,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:09,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,177 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,179 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:09,179 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:09,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,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:09,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:09,184 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:09,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:09,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,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:09,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:09,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:09,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:09,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,189 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:09,190 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,190 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:09,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:09,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,201 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:09,201 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:09,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,202 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:09,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:09,204 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,204 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:09,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,205 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,205 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,207 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:09,207 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:09,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,211 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:09,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:09,215 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:09,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:09,248 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:09,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:09,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:09,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:09,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:09,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:09,269 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:09,330 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:09,378 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:47:09,379 INFO L444 ModelExtractionUtils]: 29 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:47:09,381 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:09,383 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:47:09,383 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:09,384 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1) = 2*ULTIMATE.start_cstrncpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_1 Supporting invariants [] [2019-01-14 02:47:09,516 INFO L297 tatePredicateManager]: 11 out of 12 supporting invariants were superfluous and have been removed [2019-01-14 02:47:09,528 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:09,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:09,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:09,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:09,686 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:09,699 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:09,701 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-14 02:47:09,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 27 states and 37 transitions. Complement of second has 6 states. [2019-01-14 02:47:09,805 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:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:47:09,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2019-01-14 02:47:09,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:47:09,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:09,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:47:09,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:09,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:47:09,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:09,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 37 transitions. [2019-01-14 02:47:09,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:09,821 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 11 states and 14 transitions. [2019-01-14 02:47:09,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:47:09,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:47:09,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:47:09,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:09,823 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:47:09,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:47:09,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:47:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:47:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:47:09,845 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:47:09,845 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:47:09,846 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:47:09,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:47:09,846 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:47:09,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:47:09,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:47:09,847 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:47:09,847 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:47:09,847 INFO L794 eck$LassoCheckResult]: Stem: 146#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 143#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; 144#L385 assume !(main_~length~0 < 1); 149#L385-2 assume !(main_~n~0 < 1); 147#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.allocOnStack(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.allocOnStack(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);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 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; 148#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, cstrncpy_#t~post206.offset - 1;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); 140#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 142#L375-3 [2019-01-14 02:47:09,848 INFO L796 eck$LassoCheckResult]: Loop: 142#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 145#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, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 142#L375-3 [2019-01-14 02:47:09,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:09,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-14 02:47:09,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:09,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:09,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:09,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-14 02:47:09,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:09,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:09,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:09,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:09,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-14 02:47:09,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:47:09,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:47:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:47:09,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:47:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:47:10,812 WARN L181 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 132 [2019-01-14 02:47:10,965 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-01-14 02:47:10,970 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:47:10,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:47:10,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:47:10,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:47:10,970 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:47:10,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:47:10,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:47:10,971 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:47:10,971 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:47:10,971 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:47:10,972 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:47:10,977 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,983 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,985 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,988 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,990 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,992 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,994 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,997 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,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:11,001 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:11,006 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:11,007 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:11,459 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-01-14 02:47:11,594 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-01-14 02:47:11,595 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:11,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:11,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:11,602 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:11,604 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:11,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:11,609 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:11,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:47:11,949 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:47:12,899 WARN L181 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:47:13,029 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:47:13,029 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:47:13,030 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:13,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,033 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:13,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,034 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,035 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:13,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,038 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:13,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:13,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:13,042 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:13,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,045 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:13,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,045 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,045 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:13,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,049 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:13,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:13,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,051 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:13,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:13,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,056 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:13,056 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,058 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:47:13,058 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:47:13,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:47:13,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:47:13,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:47:13,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,062 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:47:13,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:47:13,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:47:13,063 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:13,063 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:47:13,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:47:13,064 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:47:13,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:47:13,075 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:47:13,075 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:47:13,223 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:47:13,329 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:47:13,330 INFO L444 ModelExtractionUtils]: 59 out of 66 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 02:47:13,330 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:47:13,332 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:47:13,332 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:47:13,332 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc213.base)_2 + 2*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2019-01-14 02:47:13,711 INFO L297 tatePredicateManager]: 15 out of 16 supporting invariants were superfluous and have been removed [2019-01-14 02:47:13,714 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:47:13,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:47:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:13,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:47:13,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:47:13,817 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:13,817 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:13,817 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:47:13,951 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:13,952 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:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:47:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:47:13,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:47:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:47:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:13,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:47:13,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:47:13,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-14 02:47:13,955 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:13,955 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-14 02:47:13,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:47:13,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:47:13,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:47:13,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:47:13,956 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:13,956 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:13,956 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:47:13,956 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:47:13,956 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:47:13,957 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:47:13,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:47:13,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:47:13 BoogieIcfgContainer [2019-01-14 02:47:13,963 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:47:13,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:47:13,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:47:13,963 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:47:13,964 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:05" (3/4) ... [2019-01-14 02:47:13,968 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:47:13,968 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:47:13,969 INFO L168 Benchmark]: Toolchain (without parser) took 10053.28 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 178.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:13,970 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:13,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:13,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:13,973 INFO L168 Benchmark]: Boogie Preprocessor took 28.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:13,973 INFO L168 Benchmark]: RCFGBuilder took 446.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:13,974 INFO L168 Benchmark]: BuchiAutomizer took 8831.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:47:13,975 INFO L168 Benchmark]: Witness Printer took 4.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:47:13,980 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 690.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -154.9 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 446.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8831.90 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.7 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.92 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 2 * dst + unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(n * sizeof(char))] + 2 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: 21 SDtfs, 21 SDslu, 11 SDs, 0 SdLazy, 12 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax100 hnf99 lsp96 ukn87 mio100 lsp34 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf241 smp97 tf100 neg97 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 269ms VariablesStem: 12 VariablesLoop: 7 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...