./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrcpy-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-memory-alloca/cstrcpy-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 97e7f2a31b1436c24cde90c969263f12d5fe3e2e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:32:15,534 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:32:15,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:32:15,553 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:32:15,554 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:32:15,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:32:15,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:32:15,560 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:32:15,562 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:32:15,564 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:32:15,566 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:32:15,566 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:32:15,567 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:32:15,568 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:32:15,571 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:32:15,578 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:32:15,579 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:32:15,584 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:32:15,587 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:32:15,590 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:32:15,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:32:15,595 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:32:15,599 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:32:15,600 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:32:15,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:32:15,601 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:32:15,603 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:32:15,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:32:15,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:32:15,609 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:32:15,609 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:32:15,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:32:15,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:32:15,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:32:15,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:32:15,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:32:15,613 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:32:15,628 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:32:15,628 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:32:15,629 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:32:15,629 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:32:15,629 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:32:15,629 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:32:15,630 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:32:15,630 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:32:15,630 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:32:15,630 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:32:15,630 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:32:15,630 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:32:15,631 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:32:15,632 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:32:15,632 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:32:15,632 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:32:15,632 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:32:15,632 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:32:15,632 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:32:15,633 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:32:15,633 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:32:15,633 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:32:15,633 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:32:15,634 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:32:15,634 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 -> 97e7f2a31b1436c24cde90c969263f12d5fe3e2e [2019-01-14 02:32:15,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:32:15,681 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:32:15,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:32:15,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:32:15,689 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:32:15,689 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrcpy-alloca_true-termination.c.i [2019-01-14 02:32:15,741 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6427d455/38114bbf62f2400cae85e440b4c8494e/FLAG5a870e414 [2019-01-14 02:32:16,184 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:32:16,190 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrcpy-alloca_true-termination.c.i [2019-01-14 02:32:16,206 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6427d455/38114bbf62f2400cae85e440b4c8494e/FLAG5a870e414 [2019-01-14 02:32:16,507 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6427d455/38114bbf62f2400cae85e440b4c8494e [2019-01-14 02:32:16,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:32:16,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:32:16,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:16,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:32:16,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:32:16,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:16" (1/1) ... [2019-01-14 02:32:16,521 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e3f41a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:16, skipping insertion in model container [2019-01-14 02:32:16,522 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:16" (1/1) ... [2019-01-14 02:32:16,530 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:32:16,573 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:32:16,959 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:16,972 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:32:17,132 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:17,196 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:32:17,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17 WrapperNode [2019-01-14 02:32:17,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:17,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:17,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:32:17,198 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:32:17,207 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:32:17" (1/1) ... [2019-01-14 02:32:17,226 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:32:17" (1/1) ... [2019-01-14 02:32:17,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:17,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:32:17,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:32:17,251 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:32:17,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (1/1) ... [2019-01-14 02:32:17,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:32:17,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:32:17,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:32:17,282 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:32:17,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (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:32:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:32:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:32:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:32:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:32:17,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:32:17,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:32:17,667 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:32:17,668 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-14 02:32:17,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:17 BoogieIcfgContainer [2019-01-14 02:32:17,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:32:17,669 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:32:17,670 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:32:17,673 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:32:17,674 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:17,674 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:32:16" (1/3) ... [2019-01-14 02:32:17,675 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596ab145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:17, skipping insertion in model container [2019-01-14 02:32:17,675 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:17,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:17" (2/3) ... [2019-01-14 02:32:17,676 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@596ab145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:17, skipping insertion in model container [2019-01-14 02:32:17,676 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:17,676 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:17" (3/3) ... [2019-01-14 02:32:17,678 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrcpy-alloca_true-termination.c.i [2019-01-14 02:32:17,735 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:32:17,736 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:32:17,736 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:32:17,736 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:32:17,736 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:32:17,736 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:32:17,737 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:32:17,737 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:32:17,737 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:32:17,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:32:17,775 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:17,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:17,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:17,783 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:17,783 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:17,783 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:32:17,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 02:32:17,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:17,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:17,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:17,786 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:17,786 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:17,797 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet5, main_#t~nondet6, main_#t~malloc7.base, main_#t~malloc7.offset, main_#t~malloc8.base, main_#t~malloc8.offset, main_#t~ret9.base, main_#t~ret9.offset, main_~length1~0, main_~length2~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length1~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~length2~0 := main_#t~nondet6;havoc main_#t~nondet6; 7#L558true assume !(main_~length1~0 < 1); 10#L558-2true assume !(main_~length2~0 < 1); 13#L561-1true assume !(main_~length1~0 < main_~length2~0);call main_#t~malloc7.base, main_#t~malloc7.offset := #Ultimate.allocOnStack(main_~length1~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc7.base, main_#t~malloc7.offset;call main_#t~malloc8.base, main_#t~malloc8.offset := #Ultimate.allocOnStack(main_~length2~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc8.base, main_#t~malloc8.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length2~0 - 1), 1);cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset, cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;havoc cstrcpy_#res.base, cstrcpy_#res.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, cstrcpy_#t~mem4, cstrcpy_~s1.base, cstrcpy_~s1.offset, cstrcpy_~s2.base, cstrcpy_~s2.offset, cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset, cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~s1.base, cstrcpy_~s1.offset := cstrcpy_#in~s1.base, cstrcpy_#in~s1.offset;cstrcpy_~s2.base, cstrcpy_~s2.offset := cstrcpy_#in~s2.base, cstrcpy_#in~s2.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_~s1.base, cstrcpy_~s1.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_~s2.base, cstrcpy_~s2.offset; 4#L551-3true [2019-01-14 02:32:17,797 INFO L796 eck$LassoCheckResult]: Loop: 4#L551-3true cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset := cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset;cstrcpy_~dst~0.base, cstrcpy_~dst~0.offset := cstrcpy_#t~post2.base, 1 + cstrcpy_#t~post2.offset;cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset := cstrcpy_~src~0.base, cstrcpy_~src~0.offset;cstrcpy_~src~0.base, cstrcpy_~src~0.offset := cstrcpy_#t~post3.base, 1 + cstrcpy_#t~post3.offset;call cstrcpy_#t~mem4 := read~int(cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset, 1);call write~int(cstrcpy_#t~mem4, cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset, 1); 12#L551-1true assume !!(0 != cstrcpy_#t~mem4);havoc cstrcpy_#t~mem4;havoc cstrcpy_#t~post3.base, cstrcpy_#t~post3.offset;havoc cstrcpy_#t~post2.base, cstrcpy_#t~post2.offset; 4#L551-3true [2019-01-14 02:32:17,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:17,808 INFO L82 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2019-01-14 02:32:17,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:17,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:17,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:17,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:17,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1734, now seen corresponding path program 1 times [2019-01-14 02:32:17,987 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:17,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:17,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:17,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:17,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:18,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:18,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1806939599, now seen corresponding path program 1 times [2019-01-14 02:32:18,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:18,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:18,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:18,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:18,323 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-01-14 02:32:18,467 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 02:32:19,389 WARN L181 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2019-01-14 02:32:19,583 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-14 02:32:19,596 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:19,597 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:19,597 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:19,597 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:19,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:19,598 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:19,598 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:19,598 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:19,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrcpy-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:32:19,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:19,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:19,627 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:32:19,658 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:32:19,672 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:32:19,675 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:32:19,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:20,168 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-01-14 02:32:20,378 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-01-14 02:32:20,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:20,386 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:32:20,390 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:32:20,395 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:32:20,400 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:32:20,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:20,414 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:32:20,420 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:32:20,425 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:32:20,426 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:32:20,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:20,435 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:32:20,443 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:32:20,915 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 02:32:21,558 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:32:21,793 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:21,799 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:21,801 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:32:21,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:21,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:21,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:21,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,808 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:32:21,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:21,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:21,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:21,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,812 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:32:21,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:21,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:21,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:21,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,817 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:32:21,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:21,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,818 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:21,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:21,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,821 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:32:21,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:21,827 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:21,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,834 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:32:21,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:21,839 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:21,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,843 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:32:21,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:21,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,845 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:21,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,846 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-14 02:32:21,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:21,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,852 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:32:21,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:21,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:21,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,861 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:32:21,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,863 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-14 02:32:21,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,875 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-14 02:32:21,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:21,968 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,969 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:32:21,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,974 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:21,974 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:21,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:21,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:21,993 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:21,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:21,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:21,994 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:21,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:21,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:22,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:22,019 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:32:22,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:22,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:22,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:22,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:22,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:22,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:22,127 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:22,179 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:32:22,179 INFO L444 ModelExtractionUtils]: 41 out of 49 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:32:22,182 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:22,184 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:22,185 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:22,185 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrcpy_~src~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1) = -1*ULTIMATE.start_cstrcpy_~src~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc8.base)_1 Supporting invariants [] [2019-01-14 02:32:22,381 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:32:22,389 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:22,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:22,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:22,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:22,525 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:32:22,538 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:32:22,540 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 3 states. [2019-01-14 02:32:22,644 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 3 states. Result 24 states and 27 transitions. Complement of second has 6 states. [2019-01-14 02:32:22,645 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:32:22,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:22,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2019-01-14 02:32:22,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:32:22,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:32:22,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:32:22,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:22,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 27 transitions. [2019-01-14 02:32:22,655 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:22,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-14 02:32:22,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:22,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:22,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:22,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:22,659 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:22,659 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:22,659 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:22,659 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:32:22,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:22,660 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:22,660 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:22,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:22 BoogieIcfgContainer [2019-01-14 02:32:22,666 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:22,666 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:22,667 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:22,667 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:22,667 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:17" (3/4) ... [2019-01-14 02:32:22,671 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:22,672 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:22,672 INFO L168 Benchmark]: Toolchain (without parser) took 6162.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.4 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -98.8 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:22,674 INFO L168 Benchmark]: CDTParser took 0.14 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:32:22,675 INFO L168 Benchmark]: CACSL2BoogieTranslator took 685.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:22,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:22,677 INFO L168 Benchmark]: Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:22,678 INFO L168 Benchmark]: RCFGBuilder took 387.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:22,678 INFO L168 Benchmark]: BuchiAutomizer took 4996.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:22,680 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:22,686 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.14 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 685.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -171.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4996.62 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.2 MB). Peak memory consumption was 108.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.19 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * src + unknown-#length-unknown[__builtin_alloca (length2 * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 4.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 13 SDtfs, 12 SDslu, 3 SDs, 0 SdLazy, 4 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital208 mio100 ax108 hnf99 lsp89 ukn92 mio100 lsp46 div100 bol100 ite100 ukn100 eq196 hnf88 smp100 dnf188 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 107ms VariablesStem: 11 VariablesLoop: 7 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...